Fast Approximation Algorithms for Piercing Boxes by Points.
Pankaj K. AgarwalSariel Har-PeledRahul RaychaudhuryStavros SintosPublished in: CoRR (2023)
Keyphrases
- approximation algorithms
- special case
- np hard
- worst case
- facility location problem
- minimum cost
- vertex cover
- approximation ratio
- set cover
- np hardness
- exact algorithms
- primal dual
- constant factor
- network design problem
- point sets
- undirected graph
- randomized algorithms
- approximation schemes
- open shop
- lower bound
- convex hull
- data points
- precedence constraints
- combinatorial auctions
- constraint satisfaction problems
- scheduling problem