Hardness of Set Cover with Intersection 1.
V. S. Anil KumarSunil AryaH. RameshPublished in: ICALP (2000)
Keyphrases
- set cover
- np hard
- approximation algorithms
- greedy algorithm
- network flow
- greedy heuristics
- worst case
- greedy heuristic
- computational complexity
- np complete
- solution space
- scheduling problem
- lower bound
- minimum cost
- optimal solution
- integer programming
- convex hull
- phase transition
- special case
- knapsack problem
- linear programming
- primal dual
- evolutionary algorithm
- linear program
- dynamic programming
- multi objective
- data sets