Approximation Algorithms for the Max-coloring Problem.
Sriram V. PemmarajuRajiv RamanPublished in: ICALP (2005)
Keyphrases
- approximation algorithms
- undirected graph
- special case
- np hard
- worst case
- network design problem
- set cover
- minimum cost
- vertex cover
- np hardness
- primal dual
- exact algorithms
- approximation ratio
- facility location problem
- constant factor
- approximation schemes
- open shop
- branch and bound algorithm
- constant factor approximation