Parameterized and Approximation Algorithms for the Load Coloring Problem.
Florian BarberoGregory Z. GutinMark JonesBin ShengPublished in: CoRR (2014)
Keyphrases
- approximation algorithms
- np hard
- special case
- undirected graph
- minimum cost
- vertex cover
- approximation schemes
- facility location problem
- worst case
- exact algorithms
- np hardness
- open shop
- set cover
- constant factor
- primal dual
- network design problem
- randomized algorithms
- approximation ratio
- combinatorial auctions
- disjoint paths
- precedence constraints