) is NP-hard under randomized reductions
Jin-yi CaiAjay NerurkarPublished in: Electron. Colloquium Comput. Complex. (1997)
Keyphrases
- np hard
- approximation algorithms
- scheduling problem
- special case
- optimal solution
- branch and bound algorithm
- np complete
- randomized algorithms
- constraint satisfaction problems
- remains np hard
- np hardness
- lower bound
- linear programming
- computational complexity
- decision problems
- minimum cost
- greedy heuristic
- worst case
- closely related
- integer programming
- efficient computation
- knowledge base
- knapsack problem
- computationally challenging
- randomized algorithm
- databases
- neural network
- search space
- approximation ratio
- information retrieval
- artificial intelligence
- social networks