Approximation algorithms for parallel machine scheduling with linear deterioration.
Ming LiuFeifeng ZhengShijin WangYinfeng XuPublished in: Theor. Comput. Sci. (2013)
Keyphrases
- approximation algorithms
- constant factor approximation
- np hard
- special case
- vertex cover
- worst case
- network design problem
- minimum cost
- open shop
- approximation schemes
- randomized algorithms
- facility location problem
- approximation ratio
- np hardness
- primal dual
- set cover
- quadratic program
- constant factor
- polynomial time approximation
- disjoint paths
- greedy algorithm
- optimal solution