Approximation algorithms for the bandwidth minimization problem for caterpillar graphs.
James HaralambidesFillia MakedonBurkhard MonienPublished in: SPDP (1990)
Keyphrases
- approximation algorithms
- undirected graph
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- open shop
- randomized algorithms
- graph matching
- approximation guarantees
- primal dual
- constant factor
- facility location problem
- np hardness
- disjoint paths
- network design problem
- set cover
- approximation ratio
- precedence constraints
- spanning tree
- polynomial time approximation
- combinatorial auctions
- weighted graph
- mathematical model
- graphical models