Approximation algorithms for time-constrained scheduling on line networks.
Harald RäckeAdi RosénPublished in: SPAA (2009)
Keyphrases
- approximation algorithms
- precedence constraints
- np hard
- special case
- scheduling problem
- vertex cover
- worst case
- minimum cost
- facility location problem
- network design problem
- approximation ratio
- scheduling algorithm
- randomized algorithms
- job shop
- open shop
- parallel processors
- np hardness
- set cover
- constant factor
- disjoint paths
- primal dual
- combinatorial auctions
- approximation guarantees
- job shop scheduling problem
- undirected graph
- complex networks
- network structure