Differential approximation of MIN SAT, MAX SAT and related problems

Authors:
Bruno Escoffier;Vangelis Th. Paschos
Affiliations:
LAMSADE, Université Paris-Dauphine and CNRS UMR, Paris Cedex 16, France;LAMSADE, Université Paris-Dauphine and CNRS UMR, Paris Cedex 16, France
Venue:
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Year:
2005

Citing 7
Cited 1

Computational experience with an interior point algorithm on the satisfiability problem

Annals of Operations Research
Structure in Approximation Classes

SIAM Journal on Computing
Approximation algorithms

Approximation algorithms
Some optimal inapproximability results

Journal of the ACM (JACM)
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On Dependent Randomized Rounding Algorithms

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization

Transducing Markov sequences

Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present differential approximation results (both positive and negative) for optimal satisfiability, optimal constraint satisfaction, and some of the most popular restrictive versions of them. As an important corollary, we exhibit an interesting structural difference between the landscapes of approximability classes in standard and differential paradigms.