Improved approximation algorithms for geometric set cover.
Kenneth L. ClarksonKasturi R. VaradarajanPublished in: SCG (2005)
Keyphrases
- set cover
- approximation algorithms
- np hard
- greedy heuristics
- special case
- worst case
- vertex cover
- minimum cost
- greedy algorithm
- open shop
- primal dual
- network flow
- approximation ratio
- constant factor
- constant factor approximation
- approximation schemes
- undirected graph
- greedy heuristic
- precedence constraints
- disjoint paths
- solution space