On Approximation Algorithms for Hierarchical MAX-SAT

DOI10.1006/JAGM.1997.0902zbMATH Open0891.68069OpenAlexW2085485381MaRDI QIDQ4377125

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)

Related Items (1)

On the hardness of approximating max-satisfy

Recommendations

• Improved approximation algorithms for MAX SAT 👍 👎
• On the Approximation of Maximum Satisfiability 👍 👎
• Approximation algorithms for the maximum satisfiability problem 👍 👎
• On Some Recent Approximation Algorithms for MAX SAT 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)