Approximation Algorithms for the Interval Constrained Coloring Problem.
Ernst AlthausStefan CanzarKhaled M. ElbassioniAndreas KarrenbauerJulián MestrePublished in: Algorithmica (2011)
Keyphrases
- approximation algorithms
- np hard
- special case
- undirected graph
- vertex cover
- worst case
- minimum cost
- network design problem
- set cover
- facility location problem
- open shop
- exact algorithms
- approximation ratio
- lower bound
- constant factor
- disjoint paths
- primal dual
- combinatorial auctions
- randomized algorithms
- search algorithm
- constant factor approximation
- np hardness
- precedence constraints
- optimization problems