Best possible approximation algorithm for MAX SAT with cardinality constraint

DOI10.1007/BFB0053975MaRDI QIDQ4400857zbMATH OpenFDO

Authors Maxim Sviridenko

Publication date 2 August 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0053975

zbMATH Keywords

MAX SAT problem

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Best possible approximation algorithm for MAX SAT with cardinality constraint.
• An approximation algorithm for MAX-2-SAT with cardinality constraint
• scientific article; zbMATH DE number 1979498
• Adding cardinality constraints to integer programs with applications to maximum satisfiability
• Improved approximation algorithms for MAX SAT

Cited in

(4)

• Adding cardinality constraints to integer programs with applications to maximum satisfiability
• scientific article; zbMATH DE number 1979498 (Why is no real title available?)
• An approximation algorithm for MAX-2-SAT with cardinality constraint
• Best possible approximation algorithm for MAX SAT with cardinality constraint.

This page was built for publication: Best possible approximation algorithm for MAX SAT with cardinality constraint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4400857)