Approximation Algorithms for Parallel Machine Scheduling with Speed-up Resources.
Lin ChenDeshi YeGuochuan ZhangPublished in: APPROX-RANDOM (2016)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- facility location problem
- minimum cost
- vertex cover
- approximation schemes
- set cover
- exact algorithms
- precedence constraints
- primal dual
- approximation ratio
- network design problem
- np hardness
- undirected graph
- randomized algorithms
- resource allocation
- constant factor approximation
- approximation guarantees
- open shop
- disjoint paths
- learning algorithm
- integer programming
- scheduling problem