Approximation Algorithms for the Bandwidth Minimization Problem for a Large Class of Trees.
James HaralambidesFillia MakedonPublished in: Theory Comput. Syst. (1997)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- worst case
- minimum cost
- primal dual
- facility location problem
- disjoint paths
- precedence constraints
- open shop
- approximation schemes
- approximation ratio
- undirected graph
- np hardness
- decision trees
- network design problem
- randomized algorithms
- set cover
- constant factor
- convex functions
- constant factor approximation