A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees.
Bang Ye WuKun-Mao ChaoChuan Yi TangPublished in: J. Algorithms (2000)
Keyphrases
- polynomial time approximation
- spanning tree
- minimum cost
- approximation algorithms
- np hard
- error bounds
- worst case
- edge disjoint
- identical machines
- minimum spanning tree
- optimal solution
- dynamic programming
- special case
- upper bound
- bin packing
- approximation guarantees
- lower bound
- minimum spanning trees
- linear programming
- computational complexity
- minimum total cost
- knapsack problem
- scheduling problem
- constant factor
- objective function