Simple Approximation Algorithms for Balanced MAX 2SAT

DOI10.1007/978-3-662-49529-2_49zbMATH Open1383.68100OpenAlexW3198529145MaRDI QIDQ2802976FDOQ2802976

Authors: Alice Paul, Matthias Poloczek, David P. Williamson 

Publication date: 3 May 2016

Published in: LATIN 2016: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49529-2_49

Recommendations

• Simple approximation algorithms for balanced MAX~2SAT
• scientific article; zbMATH DE number 1552232
• scientific article; zbMATH DE number 1258327
• An approximation algorithm for MAX-2-SAT with cardinality constraint
• Approximating a generalization of MAX 2SAT and MIN 2SAT
• scientific article; zbMATH DE number 1002206
• Approximation algorithms for the maximum satisfiability problem
• On Some Recent Approximation Algorithms for MAX SAT
• scientific article; zbMATH DE number 1979498

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25)

Cited In (4)

• Simple approximation algorithms for balanced MAX~2SAT
• A POLYNOMIAL TIME ALGORITHM TO DETERMINE MAXIMAL BALANCED EQUIVALENCE RELATIONS
• Balanced max 2-sat might not be the hardest
• The balance problem of min-max systems is co-nNP hard

This page was built for publication: Simple Approximation Algorithms for Balanced MAX 2SAT

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