Parameterizing MAX SNP Problems Above Guaranteed Values
From MaRDI portal
Publication:3499722
DOI10.1007/11847250_4zbMath1154.68430OpenAlexW1675014040MaRDI QIDQ3499722
Venkatesh Raman, Meena Mahajan, Somnath Sikdar
Publication date: 3 June 2008
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11847250_4
Related Items
Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey, Parameterized complexity of MaxSat above average, On the parameterized vertex cover problem for graphs with perfect matching, Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP, The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number, Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs, Parameterizing above or below guaranteed values
