Approximating MAX SAT by moderately exponential and parameterized algorithms

Authors:
Bruno Escoffier;Vangelis Th. Paschos;Emeric Tourniaire
Affiliations:
Paris Sciences et Lettres, Université Paris-Dauphine, LAMSADE, CNRS UMR 7243, France;Paris Sciences et Lettres, Université Paris-Dauphine, LAMSADE, CNRS UMR 7243, France,Institut Universitaire de France, France;Paris Sciences et Lettres, Université Paris-Dauphine, LAMSADE, CNRS UMR 7243, France
Venue:
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Year:
2012

Citing 18
Cited 0

Some optimal inapproximability results

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the complexity of K-SAT

Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT

ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Worst-case study of local search for MAX-k-SAT

Discrete Applied Mathematics - The renesse issue on satisfiability
Efficient approximation of min set cover by moderately exponential algorithms

Theoretical Computer Science
Approximation of min coloring by moderately exponential algorithms

Information Processing Letters
Exponential-time approximation of weighted set cover

Information Processing Letters
Set Partitioning via Inclusion-Exclusion

SIAM Journal on Computing
An Exponential Time 2-Approximation Algorithm for Bandwidth

Parameterized and Exact Computation
Two-query PCP with subconstant error

Journal of the ACM (JACM)
Exact and approximate bandwidth

Theoretical Computer Science
Determinant Sums for Undirected Hamiltonicity

FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms

Discrete Applied Mathematics
Improved approximation algorithms for MAX NAE-SAT and MAX SAT

WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Fixed-parameter approximation: conceptual framework and approximability results

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Parameterized approximation problems

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Survey: A survey on the structure of approximation classes

Computer Science Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study approximation of the max sat problem by moderately exponential algorithms. The general goal of the issue of moderately exponential approximation is to catch-up on polynomial inapproximability, by providing algorithms achieving, with worst-case running times importantly smaller than those needed for exact computation, approximation ratios unachievable in polynomial time. We develop several approximation techniques that can be applied to max sat in order to get approximation ratios arbitrarily close to 1.