The Hardness of Approximating Set Cover.
Alexander WolffPublished in: Lectures on Proof Verification and Approximation Algorithms (1997)
Keyphrases
- set cover
- np hard
- greedy algorithm
- approximation algorithms
- greedy heuristics
- network flow
- solution space
- greedy heuristic
- worst case
- np complete
- linear programming
- computational complexity
- scheduling problem
- special case
- lower bound
- integer programming
- minimum cost
- data sets
- convex hull
- phase transition
- linear program
- primal dual
- knapsack problem
- optimal solution
- multi dimensional
- training data
- image processing