Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics.
Martin BöhmRuben HoeksmaNicole MegowLukas NölkeBertrand SimonPublished in: MFCS (2020)
Keyphrases
- minimum cost
- steiner tree
- spanning tree
- minimum spanning tree
- np hard
- approximation algorithms
- undirected graph
- network flow
- network flow problem
- shortest path
- capacity constraints
- facility location
- edit operations
- minimum cost path
- integer programming
- linear programming relaxation
- greedy algorithm
- complex networks
- tree structure
- scheduling problem
- optimal solution
- objective function