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