Approximation Algorithms for Time Constrained Scheduling.
Klaus JansenSabine R. ÖhringPublished in: Inf. Comput. (1997)
Keyphrases
- approximation algorithms
- precedence constraints
- np hard
- special case
- scheduling problem
- vertex cover
- scheduling algorithm
- minimum cost
- primal dual
- worst case
- approximation ratio
- network design problem
- parallel processors
- constant factor
- polynomial time approximation
- approximation schemes
- resource allocation
- np hardness
- undirected graph
- set cover
- facility location problem
- open shop
- disjoint paths
- constant factor approximation
- lower bound
- release dates
- error bounds
- randomized algorithms
- strongly np hard