A Fully Polynomial Time Approximation Scheme For A NP-Hard Problem.
Marius-Simion CostandinBogdan GavreaPublished in: CoRR (2020)
Keyphrases
- np hard
- approximation algorithms
- optimal solution
- special case
- np complete
- approximation schemes
- greedy heuristic
- scheduling problem
- minimum cost
- linear programming
- worst case
- remains np hard
- integer programming
- np hardness
- closely related
- constraint satisfaction problems
- database
- lower bound
- multi agent systems
- branch and bound algorithm
- maximum weight
- computational complexity
- decision problems
- decision trees
- image processing
- single item
- neural network
- real time