Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems with Applications
Piotr BermanMarek KarpinskiAndrzej LingasPublished in: CoRR (2009)
Keyphrases
- approximation algorithms
- set cover
- np hard
- network design problem
- vertex cover
- facility location problem
- np hardness
- approximation schemes
- randomized algorithms
- np complete
- special case
- greedy algorithm
- worst case
- exact algorithms
- greedy heuristics
- minimum cost
- primal dual
- network flow
- integer programming
- approximation ratio
- optimal solution
- linear programming
- open shop
- greedy heuristic
- greedy algorithms
- exact solution
- lower bound