Constan Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem.
Daya Ram GaurToshihide IbarakiRamesh KrishnamurtiPublished in: ESA (2000)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- worst case
- minimum cost
- approximation ratio
- facility location problem
- open shop
- network design problem
- exact algorithms
- np hardness
- set cover
- precedence constraints
- randomized algorithms
- primal dual
- constant factor
- approximation schemes
- lower bound
- polynomial time approximation
- combinatorial auctions