Approximation algorithms for the ring loading problem with penalty cost.
Weidong LiJianping LiLi GuanPublished in: Inf. Process. Lett. (2014)
Keyphrases
- approximation algorithms
- minimum cost
- np hard
- constant factor
- special case
- worst case
- vertex cover
- facility location problem
- set cover
- primal dual
- np hardness
- spanning tree
- network design problem
- approximation schemes
- minimal cost
- randomized algorithms
- genetic algorithm
- precedence constraints
- approximation ratio
- undirected graph
- markov decision processes
- upper bound
- scheduling problem
- search space
- computational complexity