A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees.
Bang Ye WuGiuseppe LanciaVineet BafnaKun-Mao ChaoR. RaviChuan Yi TangPublished in: SODA (1998)
Keyphrases
- polynomial time approximation
- spanning tree
- minimum cost
- np hard
- approximation algorithms
- edge disjoint
- minimum spanning tree
- special case
- minimum total cost
- optimal solution
- minimum spanning trees
- worst case
- linear programming
- error bounds
- lower bound
- lowest cost
- scheduling problem
- integer programming
- approximation ratio
- identical machines
- linear program
- routing problem
- ad hoc networks
- branch and bound algorithm
- constant factor
- computational complexity
- greedy algorithm
- optimization problems