Abstract
An algorithm is presented for exactly counting the number of maximum weight satisfying assignments of a 2-CNF formula. The worst case running time of O(1.246n) for formulas with n variables improves on the previous bound of O(1.256n) by Dahllöf, Jonsson, and Wahlström. The algorithm uses only polynomial space. As a direct consequence we get an O(1.246n) time algorithm for counting maximum weighted independent sets in a graph.
| Original language | English (US) |
|---|---|
| Title of host publication | Algorithmic Aspects in Information and Management - Third International Conference, AAIM 2007, Proceedings |
| Pages | 47-57 |
| Number of pages | 11 |
| State | Published - Dec 1 2007 |
| Event | 3rd International Conference on Algorithmic Aspects in Information and Management, AAIM 2007 - Portland, OR, United States Duration: Jun 6 2007 → Jun 8 2007 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 4508 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Other
| Other | 3rd International Conference on Algorithmic Aspects in Information and Management, AAIM 2007 |
|---|---|
| Country | United States |
| City | Portland, OR |
| Period | 6/6/07 → 6/8/07 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)
Cite this
}
Algorithms for counting 2-SAT solutions and colorings with applications. / Furer, Martin; Kasiviswanathan, Shiva Prasad.
Algorithmic Aspects in Information and Management - Third International Conference, AAIM 2007, Proceedings. 2007. p. 47-57 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4508 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - Algorithms for counting 2-SAT solutions and colorings with applications
AU - Furer, Martin
AU - Kasiviswanathan, Shiva Prasad
PY - 2007/12/1
Y1 - 2007/12/1
N2 - An algorithm is presented for exactly counting the number of maximum weight satisfying assignments of a 2-CNF formula. The worst case running time of O(1.246n) for formulas with n variables improves on the previous bound of O(1.256n) by Dahllöf, Jonsson, and Wahlström. The algorithm uses only polynomial space. As a direct consequence we get an O(1.246n) time algorithm for counting maximum weighted independent sets in a graph.
AB - An algorithm is presented for exactly counting the number of maximum weight satisfying assignments of a 2-CNF formula. The worst case running time of O(1.246n) for formulas with n variables improves on the previous bound of O(1.256n) by Dahllöf, Jonsson, and Wahlström. The algorithm uses only polynomial space. As a direct consequence we get an O(1.246n) time algorithm for counting maximum weighted independent sets in a graph.
UR - http://www.scopus.com/inward/record.url?scp=38149122178&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=38149122178&partnerID=8YFLogxK
M3 - Conference contribution
SN - 9783540728689
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 47
EP - 57
BT - Algorithmic Aspects in Information and Management - Third International Conference, AAIM 2007, Proceedings
ER -