A Characterization of Undirected Graphs Admitting Optimal Cost Shares.
Tobias HarksAnja SchedelManuel SurekPublished in: SIAM J. Discret. Math. (2019)
Keyphrases
- optimal cost
- undirected graph
- lower bound
- expected cost
- upper bound
- directed graph
- approximation algorithms
- spanning tree
- total cost
- graph structure
- directed acyclic graph
- connected components
- complex networks
- minimum cost
- np hard
- disjoint paths
- optimal solution
- vertex set
- worst case
- special case
- piecewise linear
- long run
- computational complexity
- strongly connected
- objective function