A polynomial time approximation scheme for the two-source minimum routing cost spanning trees.
Bang Ye WuPublished in: J. Algorithms (2002)
Keyphrases
- polynomial time approximation
- spanning tree
- minimum cost
- approximation algorithms
- np hard
- edge disjoint
- minimum spanning tree
- minimum total cost
- worst case
- special case
- minimum spanning trees
- lowest cost
- linear programming
- integer programming
- constant factor
- branch and bound algorithm
- identical machines
- error bounds
- computational complexity
- routing decisions
- lower bound
- edge weights
- approximation ratio
- approximation guarantees
- routing problem
- scheduling problem
- routing algorithm
- upper bound
- knapsack problem
- linear program