On Some Recent Approximation Algorithms for MAX SAT
From MaRDI portal
Publication:5405076
DOI10.1007/978-3-642-54423-1_52zbMath1407.68553OpenAlexW171146502MaRDI QIDQ5405076
Anke van Zuylen, Matthias Poloczek, David P. Williamson
Publication date: 31 March 2014
Published in: LATIN 2014: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-54423-1_52
Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (3)
An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem ⋮ 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: On Some Recent Approximation Algorithms for MAX SAT
