Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion.
Douglas BauerHajo BroersmaAurora MorganaEdward F. SchmeichelPublished in: Discret. Appl. Math. (2002)
Keyphrases
- np hard
- worst case
- computationally hard
- np hard problems
- greedy heuristic
- computational complexity
- set cover
- special case
- np complete
- optimal solution
- approximation algorithms
- computational efficiency
- closely related
- approximate solutions
- scheduling problem
- np hardness
- decision problems
- computationally efficient
- computational cost
- significant improvement
- data structure
- times faster
- error bounds
- branch and bound algorithm
- learning algorithm
- integer programming
- benchmark datasets
- exact algorithms
- computational problems
- lower bound
- maximum weight
- fixed parameter tractable