Submodular Max-SAT
From MaRDI portal
Publication:3092241
DOI10.1007/978-3-642-23719-5_28zbMath1346.68251OpenAlexW8905951MaRDI QIDQ3092241
Ran Roth, Iftah Gamzu, Yossi Azar
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_28
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)
Related Items (7)
Deterministic \(\boldsymbol{(\unicode{x00BD}+\varepsilon)}\) -Approximation for Submodular Maximization over a Matroid ⋮ Online algorithms for BP functions maximization ⋮ On extensions of the deterministic online model for bipartite matching and max-sat ⋮ Online BP functions maximization ⋮ Online Submodular Maximization with Preemption ⋮ An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint ⋮ Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds
This page was built for publication: Submodular Max-SAT
