Improved approximation algorithms for the combination problem of parallel machine scheduling and path.
Li GuanJianping LiWeidong LiJunran LichenPublished in: J. Comb. Optim. (2019)
Keyphrases
- approximation algorithms
- minimum cost
- np hard
- special case
- vertex cover
- worst case
- disjoint paths
- randomized algorithms
- set cover
- network design problem
- precedence constraints
- constant factor
- primal dual
- approximation schemes
- undirected graph
- shortest path
- approximation ratio
- scheduling problem
- facility location problem
- open shop
- exact algorithms
- computational complexity
- setup times
- network flow
- resource allocation
- lower bound