Approximating a generalization of MAX 2SAT and MIN 2SAT
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1258327
- scientific article; zbMATH DE number 1552232
- Approximating MIN 2-SAT and MIN 3-SAT
- Approximating Succinct MaxSat
- On the Approximation of Maximum Satisfiability
- On Some Recent Approximation Algorithms for MAX SAT
- An approximation algorithm for MAX-2-SAT with cardinality constraint
- MAX SAT approximation beyond the limits of polynomial-time approximation
- scientific article; zbMATH DE number 1979498
- scientific article; zbMATH DE number 1302170
Cites work
- scientific article; zbMATH DE number 3755826 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
- Derandomizing Approximation Algorithms Based on Semidefinite Programming
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- On the Complexity of Timetable and Multicommodity Flow Problems
Cited in
(8)- A primal-dual approximation algorithm for \textsc{minsat}
- Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT
- Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
- Classes of linear programs solvable by coordinate-wise minimization
- (In)approximability of maximum minimal FVS
- Simple Approximation Algorithms for Balanced MAX 2SAT
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP
- Mathematical Foundations of Computer Science 2004
This page was built for publication: Approximating a generalization of MAX 2SAT and MIN 2SAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1841882)
