Approximation Algorithms for the Bandwidth Minimization Problem for a Large Class of Trees.
James HaralambidesFillia MakedonPublished in: ICCI (1991)
Keyphrases
- approximation algorithms
- np hard
- minimum cost
- special case
- worst case
- vertex cover
- approximation ratio
- network design problem
- facility location problem
- set cover
- primal dual
- constant factor
- randomized algorithms
- approximation schemes
- objective function
- disjoint paths
- open shop
- precedence constraints
- np hardness
- learning algorithm
- network flow
- scheduling problem
- decision trees