Bounds on Greedy Algorithms for MAX SAT
From MaRDI portal
Publication:3092215
DOI10.1007/978-3-642-23719-5_4zbMath1347.68371OpenAlexW2182988742MaRDI QIDQ3092215
Publication date: 16 September 2011
Published in: Algorithms – ESA 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-23719-5_4
Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (14)
A novel algorithm for Max Sat calling MOCE to order ⋮ An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem ⋮ Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization ⋮ CHAMP: a multipass algorithm for Max Sat based on saver variables ⋮ Advice complexity of adaptive priority algorithms ⋮ Go-MOCE: greedy order method of conditional expectations for Max Sat ⋮ On extensions of the deterministic online model for bipartite matching and max-sat ⋮ Simple approximation algorithms for balanced MAX~2SAT ⋮ Greedy matching: guarantees and limitations ⋮ Limitations of incremental dynamic programming ⋮ On conceptually simple algorithms for variants of online bipartite matching ⋮ Advice complexity of priority algorithms ⋮ Using the method of conditional expectations to supply an improved starting point for CCLS ⋮ Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds
This page was built for publication: Bounds on Greedy Algorithms for MAX SAT
