Improved Approximation Algorithms for the Demand Routing and Slotting Problem with Unit Demands on Rings.
Christine T. ChengPublished in: SIAM J. Discret. Math. (2004)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- minimum cost
- open shop
- set cover
- worst case
- primal dual
- service requirements
- precedence constraints
- facility location problem
- constant factor
- disjoint paths
- approximation schemes
- randomized algorithms
- approximation ratio
- planning horizon
- combinatorial auctions
- network design problem
- approximation guarantees
- undirected graph
- routing problem
- lead time
- routing protocol