Faster approximation algorithms for scheduling tasks with a choice of start times.
Daya Ram GaurRamesh KrishnamurtiPublished in: CCCG (2005)
Keyphrases
- approximation algorithms
- precedence constraints
- np hard
- special case
- worst case
- vertex cover
- scheduling problem
- facility location problem
- open shop
- minimum cost
- primal dual
- network design problem
- approximation ratio
- np hardness
- set cover
- approximation schemes
- undirected graph
- job shop
- computational complexity
- disjoint paths
- learning algorithm
- constant factor approximation
- strongly np hard
- randomized algorithms
- constant factor
- parallel processors
- integer programming