Improved Approximation Algorithms for Routing Shop Scheduling.
Wei YuGuochuan ZhangPublished in: ISAAC (2011)
Keyphrases
- approximation algorithms
- precedence constraints
- np hard
- special case
- vertex cover
- worst case
- facility location problem
- scheduling problem
- approximation ratio
- network design problem
- approximation schemes
- minimum cost
- np hardness
- set cover
- routing problem
- constant factor
- randomized algorithms
- shortest path
- open shop
- disjoint paths
- computational complexity
- job shop scheduling
- routing algorithm
- resource constraints
- undirected graph
- constant factor approximation