|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'503'724
Articles rated: 2609
23 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach | | Daniel Raible
; Henning Fernau
; | | Date: |
25 Mar 2008 | | Abstract: | In {sc MaxSat}, we ask for an assignment which satisfies the maximum number
of clauses for a boolean formula in CNF. We present an algorithm yielding a run
time upper bound of $O^*(2^{frac{1}{6.2158}})$ for {sc Max-2-Sat} (each
clause contains at most 2 literals), where $K$ is the number of clauses. The
run time has been achieved by using heuristic priorities on the choice of the
variable on which we branch. The implementation of these heuristic priorities
is rather simple, though they have a significant effect on the run time. The
analysis is done using a tailored non-standard measure. | | Source: | arXiv, 0803.3531 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER