) Is NP-Hard under Randomized Reductions.
Jin-yi CaiAjay NerurkarPublished in: J. Comput. Syst. Sci. (1999)
Keyphrases
- np hard
- approximation algorithms
- np complete
- special case
- branch and bound algorithm
- lower bound
- optimal solution
- np hardness
- scheduling problem
- worst case
- greedy heuristic
- randomized algorithms
- integer programming
- minimum cost
- computationally hard
- remains np hard
- knapsack problem
- closely related
- linear programming
- decision problems
- privacy preserving association rule mining
- approximation ratio
- artificial intelligence
- genetic algorithm
- boolean variables
- computationally challenging
- image processing
- randomized algorithm
- multiscale
- decision forest
- set cover
- search space
- efficient computation
- greedy algorithm