Simpler 3/4-approximation algorithms for MAX SAT

DOI10.1007/978-3-642-29116-6_16MaRDI QIDQ2896389zbMATH OpenOpenAlexFDO

Authors Anke van Zuylen

Publication date 16 July 2012

Published in Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29116-6_16

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Recommendations

• On Some Recent Approximation Algorithms for MAX SAT
• New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
• Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds
• scientific article; zbMATH DE number 1263278
• scientific article; zbMATH DE number 1342131

Cited in

(8)

• On extensions of the deterministic online model for bipartite matching and max-sat
• Simple approximation algorithms for balanced MAX~2SAT
• Bounds on greedy algorithms for MAX SAT
• Conditional Hardness of Approximating Satisfiable Max 3CSP-q
• scientific article; zbMATH DE number 1263278 (Why is no real title available?)
• New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
• An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem
• Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds

This page was built for publication: Simpler 3/4-approximation algorithms for MAX SAT

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2896389)