A Note on Closeness between NP-Hard Sets and C=P.
Tian LiuPublished in: J. Comput. Sci. Technol. (2000)
Keyphrases
- np hard
- special case
- approximation algorithms
- greedy heuristic
- linear programming
- lower bound
- np complete
- closely related
- computational complexity
- scheduling problem
- constraint satisfaction problems
- definite clause
- real time
- computationally hard
- minimum cost
- integer programming
- branch and bound algorithm
- decision problems
- worst case
- optimal solution
- data sets