Computing a Minimum-Cost k-hop Steiner Tree in Tree-Like Metrics.
Martin BöhmRuben HoeksmaNicole MegowLukas NölkeBertrand SimonPublished in: CoRR (2020)
Keyphrases
- minimum cost
- steiner tree
- spanning tree
- minimum spanning tree
- np hard
- approximation algorithms
- undirected graph
- network flow
- capacity constraints
- facility location
- network flow problem
- shortest path
- tree structure
- minimum cost path
- edge weights
- linear programming
- edit operations
- graphical models
- computational complexity
- bayesian networks