A polynomial time approximation scheme dense MIN 2SAT

DOI10.1007/3-540-48321-7_6MaRDI QIDQ4934320zbMATH OpenFDO

Authors Cristina Bazgan, W. Fernandez de la Vega

Publication date 17 January 2000

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

Full work available at URL https://doi.org/10.1007/3-540-48321-7_6

zbMATH Keywords

MIN 2SATMIN EQ

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited in

(2)

• A primal-dual approximation algorithm for \textsc{minsat}
• On approximation hardness of the minimum 2SAT-DELETION problem

This page was built for publication: A polynomial time approximation scheme dense MIN 2SAT

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