Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems.
Piotr BermanMarek KarpinskiAndrzej LingasPublished in: COCOON (2010)
Keyphrases
- approximation algorithms
- set cover
- np hard
- network design problem
- vertex cover
- facility location problem
- np hardness
- approximation schemes
- greedy heuristics
- exact algorithms
- randomized algorithms
- special case
- minimum cost
- network flow
- greedy algorithm
- primal dual
- np complete
- worst case
- lower bound
- constant factor
- optimization problems
- approximation ratio
- scheduling problem
- optimal solution
- combinatorial auctions