Approximation algorithms for the multiprocessor scheduling with submodular penalties.
Xiaofei LiuWeidong LiPublished in: Optim. Lett. (2021)
Keyphrases
- approximation algorithms
- np hard
- greedy algorithm
- special case
- worst case
- minimum cost
- vertex cover
- network design problem
- approximation ratio
- objective function
- facility location problem
- set cover
- constant factor
- exact algorithms
- energy minimization
- open shop
- primal dual
- polynomial time approximation
- constant factor approximation
- approximation schemes
- randomized algorithms
- np hardness
- precedence constraints
- disjoint paths