By Topic

Greedy Algorithms, Ordering of Variables, and d-degenerate Instances

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Cong Wang ; Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada ; Bulatov, A.A.

We consider the MAX-2-SAT problem on d-degenerate formulas. This class of 2-CNFs is a generalization of 2-CNFs of bounded tree width. We first show that the class of d-degenerate formulas is very broad, since random formulas can be shown to be d-degenerate for an appropriate d. Then we test several heuristic algorithms on random d-degenerate formulas and compare results against similar tests on regular random 2-CNFs. Finally, we model the performance of one of these algorithms, the greedy one, on both random and random d-degenerate formulas by systems of differential equations.

Published in:

Multiple-Valued Logic (ISMVL), 2012 42nd IEEE International Symposium on

Date of Conference:

14-16 May 2012