A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach

Details A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach

2008-03-25

arxiv.org/abs/0803.3531v2

Computer Science

Data Structures and Algorithms

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-349027