Approximation Algorithms for Capacitated Rectangle Stabbing.
Guy EvenDror RawitzShimon ShaharPublished in: CIAC (2006)
Keyphrases
- approximation algorithms
- network design problem
- np hard
- facility location problem
- special case
- worst case
- minimum cost
- vertex cover
- np hardness
- open shop
- lot sizing
- set cover
- primal dual
- approximation ratio
- precedence constraints
- multi item
- routing problem
- integer programming
- approximation schemes
- scheduling problem
- lower bound
- optimal solution
- vehicle routing problem
- randomized algorithms
- constant factor