Hardness of Approximating Problems on Cubic Graphs.

Paola Alimonti Viggo Kann

Published in: CIAC (1997)

Keyphrases

optimization problems
np complete
problems involving
solving problems
decision trees
similarity measure
pairwise
special case
np hard
benchmark problems
graph theory
np hardness