A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees.
Bang Ye WuGiuseppe LanciaVineet BafnaKun-Mao ChaoR. RaviChuan Yi TangPublished in: SIAM J. Comput. (1999)
Keyphrases
- polynomial time approximation
- spanning tree
- minimum cost
- approximation algorithms
- np hard
- edge disjoint
- minimum spanning tree
- special case
- minimum spanning trees
- minimum total cost
- error bounds
- worst case
- optimal solution
- constant factor
- scheduling problem
- knapsack problem
- approximation ratio
- computational complexity
- routing algorithm
- branch and bound algorithm
- ad hoc networks
- single machine
- bin packing
- linear programming
- approximation guarantees
- search algorithm
- learning algorithm