A Characterization of Undirected Graphs Admitting Optimal Cost Shares.
Tobias HarksAnja HuberManuel SurekPublished in: WINE (2017)
Keyphrases
- optimal cost
- undirected graph
- lower bound
- expected cost
- upper bound
- directed graph
- directed acyclic graph
- approximation algorithms
- total cost
- disjoint paths
- complex networks
- connected components
- spanning tree
- minimum cost
- graph structure
- np hard
- vertex set
- multicommodity flow
- optimal solution
- strongly connected
- multi class
- high dimensional
- pairwise