Typical Performance of Approximation Algorithms for NP-hard Problems.
Satoshi TakabeKoji HukushimaPublished in: CoRR (2016)
Keyphrases
- approximation algorithms
- np hard problems
- np hard
- special case
- knapsack problem
- minimum cost
- vertex cover
- np complete
- optimal solution
- lower bound
- linear programming
- worst case
- scheduling problem
- constraint programming
- branch and bound algorithm
- constraint satisfaction problems
- integer programming
- approximation ratio
- constant factor
- computational complexity
- combinatorial search
- randomized algorithms
- polynomial time approximation
- graph coloring
- similarity measure