is NP-hard for Randomized Reductions.
Miklós AjtaiPublished in: Electron. Colloquium Comput. Complex. (1997)
Keyphrases
- np hard
- approximation algorithms
- lower bound
- np complete
- optimal solution
- integer programming
- linear programming
- closely related
- special case
- branch and bound algorithm
- randomized algorithms
- remains np hard
- scheduling problem
- computational complexity
- np hardness
- worst case
- greedy heuristic
- decision problems
- constraint satisfaction problems
- minimum cost
- set cover
- computationally hard
- polynomial time approximation
- data sets
- knapsack problem
- search algorithm
- decision trees
- efficient computation
- image processing
- metadata
- knowledge base
- privacy preserving association rule mining
- genetic algorithm