Near-Linear Approximation Algorithms for Geometric Hitting Sets.
Pankaj K. AgarwalEsther EzraMicha SharirPublished in: Algorithmica (2012)
Keyphrases
- approximation algorithms
- constant factor approximation
- np hard
- special case
- worst case
- minimum cost
- vertex cover
- exact algorithms
- network design problem
- facility location problem
- randomized algorithms
- approximation ratio
- open shop
- primal dual
- set cover
- quadratic program
- approximation schemes
- greedy algorithm
- disjoint paths
- approximation guarantees
- np hardness
- precedence constraints
- undirected graph