CNF satisfiability test by counting and polynomial average time
SIAM Journal on Computing
Parameterizing above guaranteed values: MaxSat and MaxCut
Journal of Algorithms
Some optimal inapproximability results
Journal of the ACM (JACM)
Approximation algorithms for combinatorial problems
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Algorithms with large domination ratio
Journal of Algorithms
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Interval completion with few edges
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
The Linear Arrangement Problem Parameterized Above Guaranteed Value
Theory of Computing Systems
Fixed-Parameter Complexity of Minimum Profile Problems
Algorithmica - Parameterized and Exact Algorithms
Graph Theory
Parameterizing above or below guaranteed values
Journal of Computer and System Sciences
A Probabilistic Approach to Problems Parameterized above or below Tight Bounds
Parameterized and Exact Computation
Parameterized Complexity
Note on Max Lin-2 above Average
Information Processing Letters
Note on maximal bisection above tight lower bound
Information Processing Letters
Betweenness parameterized above tight lower bound
Journal of Computer and System Sciences
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
A probabilistic approach to problems parameterized above or below tight bounds
Journal of Computer and System Sciences
On parameterized independent feedback vertex set
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
A new bound for 3-satisfiable maxsat and its algorithmic application
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
New Constructive Aspects of the Lovász Local Lemma
Journal of the ACM (JACM)
Journal of Computer and System Sciences
Weak compositions and their applications to polynomial lower bounds for kernelization
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Systems of linear equations over F2 and problems parameterized above average
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
New lower bound on max cut of hypergraphs with an application to r-set splitting
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Kernelization --- preprocessing with a guarantee
The Multivariate Algorithmic Revolution and Beyond
Hi-index | 0.00 |
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2) whether a given set of m clauses of size r admits a truth assignment that satisfies at least ((2r - 1)m + k)/2r clauses. Thus Max-r-Sat is fixed-parameter tractable when parameterized by the number of satisfied clauses above the tight lower bound (1--2-r)m. This solves an open problem of Mahajan, Raman and Sikdar (J. Comput. System Sci., 75, 2009). Our algorithm is based on a polynomial-time data reduction procedure that reduces a problem instance to an equivalent algebraically represented problem with O(k2) variables. This is done by representing the instance as an appropriate polynomial, and by applying a probabilistic argument combined with some simple tools from Harmonic analysis to show that if the polynomial cannot be reduced to one of size O(k2), then there is a truth assignment satisfying the required number of clauses. Combining another probabilistic argument with tools from graph matching theory and signed graphs, we show that if an instance of Max-2-Sat with m clauses has at least 3k variables after application of certain polynomial time reduction rules to it, then there is a truth assignment that satisfies at least (3m + k)/4 clauses. We also outline how the fixed-parameter tractability result on Max-r-Sat can be extended to a family of Boolean Constraint Satisfaction Problems.