An algorithm for counting maximum weighted independent sets and its applications

Authors:
Vilhelm Dahllöf;Peter Jonsson
Affiliations:
Linköping University, SE-581 83 Linköping, Sweden;Linköping University, SE-581 83 Linköping, Sweden
Venue:
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2002

Citing 13
Cited 14

An O(20.304n) Algorithm for Solving Maximum Independent Set Problem

IEEE Transactions on Computers
Counting the number of solutions for instances of satisfiability

Theoretical Computer Science
Approximation algorithms for NP-complete problems on planar graphs

Journal of the ACM (JACM)
Number of models and satisfiability of sets of clauses

Theoretical Computer Science
The Complexity of Planar Counting Problems

SIAM Journal on Computing
Greedy local improvement and weighted set packing approximation

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Finding maximum independent sets in sparse and general graphs

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of counting colourings and independent sets in sparse graphs and hypergraphs

Computational Complexity
On the complexity of K-SAT

Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The Complexity of Counting in Sparse, Regular, and Planar Graphs

SIAM Journal on Computing
3-coloring in time 0(1.3446^n): a no-MIS algorithm

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
The good old Davis-Putnam procedure helps counting models

Journal of Artificial Intelligence Research

Counting Satisfying Assignments in 2-SAT and 3-SAT

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Determining the Number of Solutions to Binary CSP Instances

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Algorithms for four variants of the exact satisfiability problem

Theoretical Computer Science
Counting models for 2SAT and 3SAT formulae

Theoretical Computer Science
Algorithms for Counting 2-Sat Solutions and Colorings with Applications

AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Solving MINONES-2-SAT as fast as VERTEX COVER

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Solving minimum weight exact satisfiability in time O(20.2441n)

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On some weighted satisfiability and graph problems

SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Counting all solutions of minimum weight exact satisfiability

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
On the effective enumerability of NP problems

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Branching and treewidth based exact algorithms

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Linear-programming design and analysis of fast algorithms for Max 2-CSP

Discrete Optimization
Counting minimum weighted dominating sets

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Parameterized top-K algorithms

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an O(1.3247n) algorithm for counting the number of independent sets with maximum weight in graphs. We show how this algorithm can be used solving a number of different counting problems: counting exact covers, exact hitting sets, weighted set packing and satisfying assignments in 1-in-k SAT.