Approximation algorithms for the shortest total path length spanning tree problem.
Bang Ye WuKun-Mao ChaoChuan Yi TangPublished in: Discret. Appl. Math. (2000)
Keyphrases
- path length
- approximation algorithms
- shortest path
- np hard
- special case
- minimum cost
- small world
- worst case
- spanning tree
- vertex cover
- clustering coefficient
- approximation ratio
- facility location problem
- undirected graph
- constant factor
- open shop
- primal dual
- approximation schemes
- set cover
- precedence constraints
- randomized algorithms
- combinatorial auctions
- objective function
- social network analysis
- polynomial time approximation
- linear programming
- lower bound