Improved Approximation Algorithms for Connected Domatic Partitions and Related Problems
Alina EneNitish KorulaAli VakilianPublished in: CoRR (2013)
Keyphrases
- approximation algorithms
- related problems
- np hard
- special case
- minimum cost
- worst case
- vertex cover
- broadly applicable
- np hardness
- facility location problem
- network design problem
- approximation ratio
- primal dual
- undirected graph
- precedence constraints
- set cover
- open shop
- approximation schemes
- exact algorithms
- stable marriage
- randomized algorithms
- genetic algorithm
- integer programming
- connected components
- upper bound
- search space