On Approximation Algorithms for Hierarchical MAX-SAT

DOI10.1006/JAGM.1997.0902MaRDI QIDQ4377125zbMATH OpenOpenAlexFDO

Authors Sameet Agarwal, Anne Condon

Publication date 31 March 1998

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1997.0902

zbMATH Keywords

approximation algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1552232
• scientific article; zbMATH DE number 1258327
• On Some Recent Approximation Algorithms for MAX SAT
• scientific article; zbMATH DE number 1302170
• scientific article; zbMATH DE number 1002206
• Approximation algorithms for the maximum satisfiability problem
• On the Approximation of Maximum Satisfiability
• Improved approximation algorithms for MAX SAT
• scientific article; zbMATH DE number 1445292

Cited in

(2)

• On the hardness of approximating max-satisfy
• On the hardness of satisfiability with bounded occurrences in the polynomial-time hierarchy

This page was built for publication: On Approximation Algorithms for Hierarchical MAX-SAT

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