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