Approximation Algorithms for Time-Constrained Scheduling on Line Networks.
Harald RäckeAdi RosénPublished in: Theory Comput. Syst. (2011)
Keyphrases
- approximation algorithms
- precedence constraints
- np hard
- special case
- scheduling problem
- worst case
- minimum cost
- vertex cover
- randomized algorithms
- constant factor
- set cover
- network design problem
- approximation schemes
- approximation ratio
- primal dual
- facility location problem
- undirected graph
- disjoint paths
- parallel processors
- network design
- resource constraints
- open shop
- job shop scheduling
- scheduling algorithm
- resource allocation