# 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}
}
• Published in
The Multivariate Algorithmic…
24 August 2011
• Mathematics
We consider constraint satisfaction problems parameterized above or below tight bounds. One example is MaxSat parameterized above m/2: given a CNF formula F with m clauses, decide whether there is a truth assignment that satisfies at least m/2+k clauses, where k is the parameter. Among other problems we deal with are MaxLin2-AA (given a system of linear equations over $\mathbb{F}_2$ in which each equation has a positive integral weight, decide whether there is an assignment to the variables…
Parameterized Constraint Satisfaction Problems: a Survey
• Mathematics
The Constraint Satisfaction Problem
• 2017
This work considers constraint satisfaction problems parameterized above or below guaranteed values, both polynomial kernels and parameterized algorithms, and discusses results and questions obtained for the problems mainly in the last few years.
Satisfiability of Ordering CSPs above Average is Fixed-Parameter Tractable
• Mathematics, Computer Science
2015 IEEE 56th Annual Symposium on Foundations of Computer Science
• 2015
A new Bonami-type inequality for the Efron -- Stein decomposition is proved, which applies to functions defined on arbitrary product probability spaces and does not depend on the mass of the smallest atom in the probability space.
Satisfiability of Ordering CSPs Above Average
• Mathematics, Computer Science
ArXiv
• 2015
A new Bonami-type inequality for the Efron-Stein decomposition is proved that applies to functions defined on arbitrary product probability spaces and does not depend on the mass of the smallest atom in the probability space.
The Constraint Satisfaction Problem: Complexity and Approximability
• Computer Science
The Constraint Satisfaction Problem
• 2017
This report documents the material presented during the course of the Dagstuhl Seminar 18231 “The Constraint Satisfaction Problem: Complexity and Approximability”, aimed at bringing together researchers using all the different techniques in the study of the CSP to share their insights obtained.
Parameterized Traveling Salesman Problem: Beating the Average
• Mathematics
SIAM J. Discret. Math.
• 2016
A considerable generalization of Vizing's result is proved: for each fixed $k$, an algorithm is given that decides whether, for any input edge weighting of $K_n$, there is a Hamilton cycle of weight at most $h(w)-k$ (and constructs such a cycle if it exists).
Parameterized TSP: Beating the Average
• Mathematics
ArXiv
• 2014
A considerable generalisation of Vizing's result is proved: for each fixed $k$, an algorithm is given that decides whether, for any input edge weighting of $K_n$, there is a Hamilton cycle of weight at most $h(w)-k$ (and constructs such a cycle if it exists).
Improved Exact Algorithms for Mildly Sparse Instances of Max SAT
• Computer Science
IPEC
• 2015
The first result is a deterministic polynomial space algorithm with mu(c)=1/O(c * log(c)) that achieves the previous best time complexity without exponential space or randomization and can handle instances with exponentially large weights and hard constraints.
The Parameterized Complexity of Cycle Packing: Indifference is Not an Issue
• Mathematics, Computer Science
LATIN
• 2018
This paper shows that Cycle Packing is fixed-parameter tractable (FPT) when parameterized by t, the size of a proper interval deletion set, and combines color coding, greedy strategy and dynamic programming based on structural properties of proper interval graphs in a non-trivial fashion to obtain the FPT algorithm.
Kernelization, MaxLin Above Average
• A. Yeo
• Mathematics
Encyclopedia of Algorithms
• 2016
The problem MAXLIN2 is a well-studied problem, which according to Hastad [8] “is as basic as satisfiability” and the basic definitions of fixed-parameter tractability (FPT) are given.

## References

SHOWING 1-10 OF 85 REFERENCES
Parameterized Complexity of MaxSat above Average
• Mathematics
LATIN
• 2012
It is shown that assuming the exponential time hypothesis, Max-r(n)-Sat-AA is not fixed-parameter tractable already for any r(n)≥loglogn+φ(n), where φ( n) is any unbounded strictly increasing function.
Solving MAX-r-SAT Above a Tight Lower Bound
• Computer Science
SODA '10
• 2010
An exact algorithm is presented that decides whether a given multiset of m clauses of size r admits a truth assignment that satisfies at least ((2r−1)m+k)/2r clauses, and Max-r-Sat is fixed-parameter tractable when parameterized by the number of satisfied clauses above the tight lower bound (1−2−r)m.
Improved Parameterized Algorithms for above Average Constraint Satisfaction
• Computer Science, Mathematics
IPEC
• 2011
This work presents a faster parameterized algorithm for deciding whether m/2+k/2 equations can be simultaneously satisfied over F2, and obtains O(k)-variable bikernels for boolean CSPs of arity c for every fixed c, and for permutation C SPs ofArity 3, which implies linear bik kernels for many problems under the "above average" parameterization.
A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application
• Mathematics
FCT
• 2011
The 2/3m bound for expanding 3- satisfiable CNF formulas is strengthened by showing that for every such formula F at least 2 3m+ρn clauses of F can be satisfied by a truth assignment, where ρ(> 0.0019) is a constant.
Improved Parameterized Algorithms for Constraint Satisfaction
• Computer Science, Mathematics
ArXiv
• 2010
A faster parameterized algorithm for deciding whether $m/2+k/2$ equations can be simultaneously satisfied over ${\mathbb F}_2$ and obtaining non-trivial hybrid algorithms for every Max $c$-CSP.
A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications
• Mathematics
Algorithmica
• 2011
This work improves the Lieberherr-Specker bound by showing that for each UCF CNF formula F with m clauses the authors can find, in polynomial time, a subformula F′ with m′ clauses such that they can simultaneously satisfy at least m clauses.
Note on Max Lin-2 above Average
• Computer Science, Mathematics
Inf. Process. Lett.
• 2010
Systems of Linear Equations over F2 and Problems Parameterized above Average
• Mathematics, Computer Science
SWAT
• 2010
It is proved that for each fixed r≥2, Max r-Lin AA and Max Exact r-SAT AA can be solved in time 2O(k logk)+mO(1), and a tight lower bound on the maxima of pseudo-boolean functions is obtained.