Approximation of Natural W[P]-Complete Minimisation Problems Is Hard.

Kord Eickmeyer Martin Grohe Magdalena Grüber

Published in: Computational Complexity Conference (2008)

Keyphrases

data sets
real world
database
optimization problems
np complete
related problems
computer vision
objective function
multi agent
simulated annealing
benchmark problems
problems involving
solving problems
hard problems
computationally hard
approximation schemes