Approximation Hardness for Small Occurrence Instances of NP-Hard Problems.

Miroslav Chlebík Janka Chlebíková

Published in: CIAC (2003)

Keyphrases

np hard problems
np hard
knapsack problem
constraint programming
randomly generated
computational complexity
combinatorial search
worst case
optimal solution
special case
branch and bound algorithm
phase transition
graph coloring