An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem
DOI10.1145/3064174zbMATH Open1414.68105OpenAlexW2754549065MaRDI QIDQ4577945FDOQ4577945
Authors: Matthias Poloczek, David P. Williamson Edit this on Wikidata
Publication date: 6 August 2018
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3064174
Recommendations
- scientific article; zbMATH DE number 1002206
- Approximation algorithms for the maximum satisfiability problem
- scientific article; zbMATH DE number 1258327
- scientific article; zbMATH DE number 1302170
- Approximating MAX SAT by moderately exponential and parameterized algorithms
- Approximating MAX SAT by moderately exponential and parameterized algorithms
- scientific article; zbMATH DE number 1552232
- On Some Recent Approximation Algorithms for MAX SAT
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25)
Cites Work
- CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
- Approximation algorithms for combinatorial problems
- Iterative and core-guided maxsat solving: a survey and assessment
- Title not available (Why is that?)
- Cores in core based MaxSat algorithms: an analysis
- Open-WBO: a modular MaxSAT solver
- New local search methods for partial MaxSAT
- \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Syntactic versus Computational Views of Approximability
- On Some Recent Approximation Algorithms for MAX SAT
- Tight bound on Johnson's algorithm for maximum satisfiability
- Bounds on greedy algorithms for MAX SAT
- Unsatisfiability-based optimization in clasp
- Randomized greedy: new variants of some classic approximation algorithms
- Maximum satisfiability: how good are tabu search and plateau moves in the worst-case?
- Deterministic algorithms for submodular maximization problems
- Title not available (Why is that?)
- Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds
- On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
- Progress in clasp series 3
- Simpler 3/4-approximation algorithms for MAX SAT
- A tight linear time (1/2)-approximation for unconstrained submodular maximization
- Randomized variants of Johnson's algorithm for MAX SAT
- Multi-criteria optimization in answer set programming
- On using incremental encodings in unsatisfiability-based MaxSAT solving
Cited In (1)
This page was built for publication: An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4577945)
