Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs.
Yuji ObataTakao NishizekiPublished in: Theor. Comput. Sci. (2015)
Keyphrases
- approximation algorithms
- np hard
- special case
- undirected graph
- vertex cover
- minimum cost
- approximation ratio
- worst case
- precedence constraints
- randomized algorithms
- np hardness
- network design problem
- primal dual
- approximation schemes
- learning algorithm
- facility location problem
- approximation guarantees
- spanning tree
- linear programming
- open shop
- disjoint paths