Tight Bounds on Local Search to Approximate the Maximum Satisfiability Problems
From MaRDI portal
Publication:3087938
DOI10.1007/978-3-642-22685-4_5zbMath1348.68234MaRDI QIDQ3087938
Shaohan Ma, Pingping Zhang, Daming Zhu
Publication date: 17 August 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22685-4_5
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Approximating Max NAE-\(k\)-SAT by anonymous local search, Local Search to Approximate Max NAE-$$k$$-Sat Tightly