The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover.
Dana MoshkovitzPublished in: Theory Comput. (2015)
Keyphrases
- np hardness
- set cover
- np hard
- approximation algorithms
- discrete tomography
- greedy heuristics
- special case
- lower bound
- worst case
- greedy heuristic
- upper bound
- scheduling problem
- minimum cost
- integer programming
- optimal solution
- computational complexity
- worst case analysis
- convex hull
- linear programming
- network flow
- decision problems
- greedy algorithm
- mixed integer
- linear program
- knapsack problem
- genetic algorithm
- primal dual
- multi dimensional
- training data
- learning algorithm