Simpler 3/4-Approximation Algorithms for MAX SAT
From MaRDI portal
Publication:2896389
DOI10.1007/978-3-642-29116-6_16zbMath1242.68374OpenAlexW1593314081MaRDI QIDQ2896389
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
Related Items (4)
An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem ⋮ On extensions of the deterministic online model for bipartite matching and max-sat ⋮ Simple approximation algorithms for balanced MAX~2SAT ⋮ 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
