A Characterization of Undirected Graphs Admitting Optimal Cost Shares.
Tobias HarksAnja HuberManuel SurekPublished in: CoRR (2017)
Keyphrases
- optimal cost
- undirected graph
- lower bound
- expected cost
- approximation algorithms
- directed graph
- upper bound
- directed acyclic graph
- total cost
- minimum cost
- disjoint paths
- connected components
- np hard
- worst case
- graph structure
- spanning tree
- multicommodity flow
- strongly connected
- complex networks
- special case
- undirected graphical models
- vertex set
- cost function
- piecewise linear
- training set
- optimal solution