.879-approximation algorithms for MAX CUT and MAX 2SAT
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Finding almost-satisfying assignments
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Identifying gene regulatory networks from experimental data
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Improved approximation algorithms for MAX SAT
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Combinatorial approximation algorithms for the maximum directed cut problem
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Algorithmic derandomization via complexity theory
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Approximating Scheduling Unrelated Parallel Machines in Parallel
Computational Optimization and Applications
Improved approximation algorithms for MAX SAT
Journal of Algorithms
An improved approximation algorithm for the partial latin square extension problem
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
The RPR2 Rounding Technique for Semidefinite Programs
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Random Instance Generation for MAX 3SAT
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Algorithms Based on Randomization and Linear and Semidefinite Programming
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation algorithms for the maximum satisfiability problem
Nordic Journal of Computing
Discrete Applied Mathematics
Tight Bound on Johnson's Algoritihm for Max-SAT
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
A Short Guide To Approximation Preserving Reductions
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Tight approximation algorithms for maximum general assignment problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT
Theoretical Computer Science - Foundations of computation theory (FCT 2003)
The RPR2 rounding technique for semidefinite programs
Journal of Algorithms
The approximability of non-Boolean satisfiability problems and restricted integer programming
Theoretical Computer Science
GRASP with path relinking for the weighted MAXSAT problem
Journal of Experimental Algorithmics (JEA)
Adding cardinality constraints to integer programs with applications to maximum satisfiability
Information Processing Letters
Limited view CT reconstruction and segmentation via constrained metric labeling
Computer Vision and Image Understanding
MAX-2-SAT: how good is Tabu search in the worst-case?
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Covering Games: Approximation through Non-cooperation
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Pricing commodities, or how to sell when buyers have restricted valuations
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Theoretical Computer Science
Tight Approximation Algorithms for Maximum Separable Assignment Problems
Mathematics of Operations Research
Tight bounds on local search to approximate the maximum satisfiability problems
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Database foundations for scalable RDF processing
RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
Bounds on greedy algorithms for MAX SAT
ESA'11 Proceedings of the 19th European conference on Algorithms
ESA'11 Proceedings of the 19th European conference on Algorithms
Geometric rounding: a dependent randomized rounding scheme
Journal of Combinatorial Optimization
Improved approximation algorithms for MAX NAE-SAT and MAX SAT
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Randomized greedy: new variants of some classic approximation algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Randomized variants of Johnson's algorithm for MAX SAT
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
GRASP with path-relinking for the weighted maximum satisfiability problem
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Characterizing propagation methods for boolean satisfiability
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Simpler 3/4-approximation algorithms for MAX SAT
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Improved approximation of maximum vertex cover
Operations Research Letters
An improved approximation algorithm for the partial Latin square extension problem
Operations Research Letters
Operations Research Letters
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Complexity of approximating CSP with balance / hard constraints
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |
Yannakakis recently presented the first $\frac{3}{4}$-approximation algorithm for the Maximum Satisfiability Problem (MAX SAT). His algorithm makes nontrivial use of solutions to maximum flow problems. New, simple $\frac{3}{4}$-approximation algorithms that apply the probabilistic method/randomized rounding to the solution to a linear programming relaxation of MAX SAT are presented. It is shown that although standard randomized rounding does not give a good approximate result, the best solution of the two given by randomized rounding and a well-known algorithm of Johnson is always within $\frac{3}{4}$ of the optimal solution. It is further shown that an unusual twist on randomized rounding also yields $\frac{3}{4}$-approximation algorithms. As a by-product of the analysis, a tight worst-case analysis of the relative duality gap of the linear programming relaxation is obtained.