Improved approximation algorithms for MAX SAT
From MaRDI portal
Publication:2777611
DOI10.1006/JAGM.2001.1202zbMATH Open0990.68078OpenAlexW2018025029MaRDI QIDQ2777611FDOQ2777611
Authors: T. Asano, David P. Williamson 
Publication date: 14 August 2002
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.2001.1202
Recommendations
Cited In (26)
- Approximation and Online Algorithms
- Sums of squares based approximation algorithms for MAX-SAT
- MAX SAT approximation beyond the limits of polynomial-time approximation
- Adding cardinality constraints to integer programs with applications to maximum satisfiability
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved approximation algorithms for the Min-Max selecting items problem
- Bounds on greedy algorithms for MAX SAT
- Title not available (Why is that?)
- Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles
- Improved approximations for max set splitting and max NAE SAT
- The labeled perfect matching in bipartite graphs
- On Approximation Algorithms for Hierarchical MAX-SAT
- An approximation algorithm for MAX 3-SAT
- An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT
- Improvements to Hybrid Incremental SAT Algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Local Search to Approximate Max NAE-$$k$$-Sat Tightly
- Approximating MIN 2-SAT and MIN 3-SAT
- On Some Recent Approximation Algorithms for MAX SAT
- Title not available (Why is that?)
- An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT.
- Approximating Max NAE-\(k\)-SAT by anonymous local search
- Dealing with 4-variables by resolution: an improved MaxSAT algorithm
This page was built for publication: Improved approximation algorithms for MAX SAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2777611)
