Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem.
Daya Ram GaurToshihide IbarakiRamesh KrishnamurtiPublished in: J. Algorithms (2002)
Keyphrases
- approximation algorithms
- constant factor
- np hard
- axis parallel
- special case
- minimum cost
- facility location problem
- worst case
- vertex cover
- approximation ratio
- primal dual
- network design problem
- randomized algorithms
- set cover
- arbitrarily close
- open shop
- exact algorithms
- np hardness
- lower bound
- approximation guarantees
- strongly np hard
- learning algorithm