Subexponential and FPT-time Inapproximability of Independent Set and Related Problems

Bruno Escoffier Eun Jung Kim Vangelis Th. Paschos

Published in: CoRR (2012)

Keyphrases

related problems
independent set
approximation algorithms
maximum independent set
maximum weight
range searching
stable marriage
np hard
bayesian networks
np complete