Parameterizing MAX SNP Problems Above Guaranteed Values

@inproceedings{Mahajan2006ParameterizingMS,
  title={Parameterizing MAX SNP Problems Above Guaranteed Values},
  author={Meena Mahajan and Venkatesh Raman and Somnath Sikdar},
  booktitle={IWPEC},
  year={2006}
}
We show that every problem in MAX SNP has a lower bound on the optimum solution size and that the above guarantee question with respect to that lower bound is fixed parameter tractable. We next introduce the notion of ‘tight’ upper and lower bounds for the optimum solution and show that the parameterized version of a variant of the above guarantee question with respect to the tight lower bound cannot be fixed parameter tractable unless P = NP, for a number of NP-optimization problems. 

From This Paper

Topics from this paper.

Similar Papers

Loading similar papers…