An improved branching algorithm for \((n,3)\)-MaxSAT based on refined observations

DOI10.1007/978-3-319-71147-8_7zbMath1474.68329OpenAlexW2768604257MaRDI QIDQ1708599

Wenjun Li, Chao Xu, Yongjie Yang, Jianxin Wang

Publication date: 26 March 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-71147-8_7

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Algorithms for \((n,3)\)-MAXSAT and parameterization above the all-true assignment ⋮ An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses

This page was built for publication: An improved branching algorithm for \((n,3)\)-MaxSAT based on refined observations