Improved approximation algorithms for max-2SAT with cardinality constraint
From MaRDI portal
Recommendations
- An approximation algorithm for MAX-2-SAT with cardinality constraint
- Improved approximation algorithms for MAX SAT
- scientific article; zbMATH DE number 1445292
- Improving exact algorithms for MAX-2-SAT
- Approximation and Online Algorithms
- Best possible approximation algorithm for MAX SAT with cardinality constraint
- scientific article; zbMATH DE number 1552232
- scientific article; zbMATH DE number 1258327
- A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem
- Improved exact algorithms for MAX-SAT
Cited in
(11)- Approximating a generalization of MAX 2SAT and MIN 2SAT
- Adding cardinality constraints to integer programs with applications to maximum satisfiability
- Simple Approximation Algorithms for Balanced MAX 2SAT
- Best possible approximation algorithm for MAX SAT with cardinality constraint
- Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder
- An approximation algorithm for MAX-2-SAT with cardinality constraint
- Best possible approximation algorithm for MAX SAT with cardinality constraint.
- Parameterized approximation scheme for biclique-free max k-weight SAT and max coverage
- On MAX-SAT with cardinality constraint
- On MAX-SAT with cardinality constraint
- Improved FPT approximation scheme and approximate kernel for biclique-free max k-weight SAT: greedy strikes back
This page was built for publication: Improved approximation algorithms for max-2SAT with cardinality constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4425953)