On the minimum satisfiability problem

DOI10.1007/978-3-030-39219-2_23MaRDI QIDQ779212zbMATH OpenOpenAlexFDO

Authors Umair Arif, Robert Benkoczi, Daya Ram Gaur, Ramesh Krishnamurti

Publication date 21 July 2020

Full work available at URL https://doi.org/10.1007/978-3-030-39219-2_23

zbMATH Keywords

approximation algorithmminimum satisfiabilityprimal-dual algorithm

Mathematics Subject Classification ID

Computational aspects of satisfiability (68R07) Approximation algorithms (68W25)

Recommendations

• A primal-dual approximation algorithm for \textsc{minsat}
• On approximation algorithms for the minimum satisfiability problem
• The Minimum Satisfiability Problem
• On the Approximation of Maximum Satisfiability
• Approximating MIN 2-SAT and MIN 3-SAT

Cited in

(9)

• On approximation algorithms for the minimum satisfiability problem
• On the minimal solution of the problem of primitives
• Optimizing with minimum satisfiability
• A primal-dual approximation algorithm for \textsc{minsat}
• scientific article; zbMATH DE number 1688380 (Why is no real title available?)
• The Minimum Satisfiability Problem
• scientific article; zbMATH DE number 2119705 (Why is no real title available?)
• On the minimum consistent subset problem
• Revisiting maximum satisfiability and related problems in data streams

This page was built for publication: On the minimum satisfiability problem

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