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