An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem
From MaRDI portal
Publication:4577945
DOI10.1145/3064174zbMath1414.68105OpenAlexW2754549065MaRDI QIDQ4577945
Matthias Poloczek, David P. Williamson
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
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New local search methods for partial MaxSAT
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
- Approximation algorithms for combinatorial problems
- Tight bound on Johnson's algorithm for maximum satisfiability
- Maximum satisfiability: how good are tabu search and plateau moves in the worst-case?
- Iterative and core-guided maxsat solving: a survey and assessment
- Simpler 3/4-Approximation Algorithms for MAX SAT
- Multi-Criteria Optimization in Answer Set Programming
- CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
- Bounds on Greedy Algorithms for MAX SAT
- Cores in Core Based MaxSat Algorithms: An Analysis
- Open-WBO: A Modular MaxSAT Solver,
- Progress in clasp Series 3
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
- On Syntactic versus Computational Views of Approximability
- Deterministic Algorithms for Submodular Maximization Problems
- On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
- On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving
- ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver
- Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds
- Unsatisfiability-based optimization in clasp
- On Some Recent Approximation Algorithms for MAX SAT
This page was built for publication: An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem
