Polynomial-time approximation algorithms for the coloring problem in some cases.
Dmitriy S. MalyshevPublished in: J. Comb. Optim. (2017)
Keyphrases
- approximation algorithms
- special case
- np hard
- worst case
- vertex cover
- np hardness
- undirected graph
- facility location problem
- approximation ratio
- minimum cost
- network design problem
- open shop
- set cover
- combinatorial auctions
- primal dual
- constant factor
- computational complexity
- search algorithm
- precedence constraints
- randomized algorithms
- exact algorithms