Low-Cost Approximation Algorithms for Scheduling Independent Tasks on Hybrid Platforms.
Louis-Claude CanonLoris MarchalFrédéric VivienPublished in: Euro-Par (2017)
Keyphrases
- approximation algorithms
- low cost
- precedence constraints
- np hard
- special case
- worst case
- scheduling problem
- vertex cover
- facility location problem
- randomized algorithms
- approximation ratio
- approximation schemes
- minimum cost
- undirected graph
- open shop
- network design problem
- primal dual
- resource constraints
- real time
- constant factor
- np hardness
- constant factor approximation
- polynomial time approximation
- computational complexity