Constraint Satisfaction Problems Parameterized Above or Below Tight Bounds: A Survey

@inproceedings{Gutin2012ConstraintSP,
  title={Constraint Satisfaction Problems Parameterized Above or Below Tight Bounds: A Survey},
  author={Gregory Gutin and Anders Yeo},
  booktitle={The Multivariate Algorithmic Revolution and Beyond},
  year={2012}
}
We consider constraint satisfaction problems parameteriz ed above or below tight bounds. One example is MaxSat parameterized abo ve m/2: given a CNF formulaF with m clauses, decide whether there is a truth assignment that satisfies at least m/2 + k clauses, wherek is the parameter. Among other problems we deal with are MaxLin2-AA (given a system of linea r quations over F2 in which each equation has a positive integral weight, decid e whether there is an assignment to the variables that… CONTINUE READING
Highly Cited
This paper has 22 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 53 references

Parameterizing above guarantee d values: MaxSat and MaxCut

  • M. Mahajan, V. Raman
  • J. Algorithms,
  • 1999
Highly Influential
11 Excerpts

Complexity of partial sa tisf ction

  • K. J. Lieberherr, E. Specker
  • II. Tech. Report 293,
  • 1982
Highly Influential
4 Excerpts

Wojtaszcz yk, On Multiway Cut parameterized above lower bounds

  • M. Cygan, M. Pilipczuk, J.O
  • IPEC
  • 2011
Highly Influential
4 Excerpts

Polynomial-t ime recognition of minimal unsatisfiable formulas with fixed clause-variable difference

  • H. Fleischner, O. Kullmann, S. Szeider
  • 2002
Highly Influential
7 Excerpts

Similar Papers

Loading similar papers…