Parameterizing above or below guaranteed values

  • Authors:

  • Meena Mahajan;Venkatesh Raman;Somnath Sikdar

  • Affiliations:

  • The Institute of Mathematical Sciences, C.I.T. Campus, Taramani, Chennai 600113, India;The Institute of Mathematical Sciences, C.I.T. Campus, Taramani, Chennai 600113, India;The Institute of Mathematical Sciences, C.I.T. Campus, Taramani, Chennai 600113, India

  • Venue:
  • Journal of Computer and System Sciences
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider new parameterizations of NP-optimization problems that have nontrivial lower and/or upper bounds on their optimum solution size. The natural parameter, we argue, is the quantity above the lower bound or below the upper bound. We show that for every problem in MAX SNP, the optimum value is bounded below by an unbounded function of the input-size, and that the above-guarantee parameterization with respect to this lower bound is fixed-parameter tractable. We also observe that approximation algorithms give nontrivial lower or upper bounds on the solution size and that the above or below guarantee question with respect to these bounds is fixed-parameter tractable for a subclass of NP-optimization problems. We then introduce the notion of 'tight' lower and upper bounds and exhibit a number of problems for which the above-guarantee and below-guarantee parameterizations with respect to a tight bound is fixed-parameter tractable or W-hard. We show that if we parameterize ''sufficiently'' above or below the tight bounds, then these parameterized versions are not fixed-parameter tractable unless P=NP, for a subclass of NP-optimization problems. We also list several directions to explore in this paradigm.