Corpus ID: 15518371

An algorithm for counting maximum weighted independent sets and its applications

  title={An algorithm for counting maximum weighted independent sets and its applications},
  author={Vilhelm Dahll{\"o}f and P. Jonsson},
  booktitle={SODA '02},
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. 

Figures and Topics from this paper

Algorithms for Counting 2-SAT Solutions and Colorings with Applications
An algorithm is presented for exactly counting the number of maximum weight satisfying assignments of a 2- Cnf formula that improves on the previous bound of O( 1.246n) by Dahllof, Jonsson, and Wahlstrom. Expand
Counting Minimum Weighted Dominating Sets
This work shows how to count all minimum weighted dominating sets of a graph on n vertices in time O(1.5535n), and introduces a technique of measuring running time of the algorithm by combining measure and conquer approach with linear programming. Expand
Counting Satisfying Assignments in 2-SAT and 3-SAT
We present an O(1.3247n) algorithm for counting the number of satisfying assignments for instances of 2-SAT and an O(1.6894n) algorithm for instances of 3-SAT. This is an improvement compared to theExpand
A Polynomial Time Algorithm for Counting the Number of Independent Sets of Cactus Graphs
This paper presents a polynomial time algorithm for counting the number of independent sets on a special class of graphs called cactus graphs, based on previous results on unicyclic graphs. Expand
Basic Pattern Graphs for the Efficient Computation of Its Number of Independent Sets
It is shown that for a graph G where its set of cycles can be arranged as embedded cycles, i(G) can be computed in polynomial time. Expand
Counting All Solutions of Minimum Weight Exact Satisfiability
We show that the number of all solutions of minimum weight exact satisfiability can be found in O(n2.||C||+20.40567 n) time, for a CNF formula C containing n propositional variables equipped withExpand
Branching and Treewidth Based Exact Algorithms
Several examples of possible combinations of branching and programming which provide the fastest known algorithms for a number of NP hard problems: Minimum Maximal Matching and some variations, counting the number of maximum weighted independent sets. Expand
Improved Bounds for Exact Counting of Satisfiability Solutions ∗
An algorithm is presented for exactly solving (in fact, counting) the number of maximum weight satisfying assignments of a 2-SAT formula. The worst case running time of O(1.2461) for formulas with nExpand
Exact algorithms for maximum weighted independent set on sparse graphs
  • Sen Huang, Mingyu Xiao, Xiaoyu Chen
  • Computer Science
  • ArXiv
  • 2021
The maximum independent set problem is one of the most important problems in graph algorithms and has been extensively studied in the line of research on the worst-case analysis of exact algorithmsExpand
Using Combinatorics to Prune Search Trees: Independent and Dominating Set
A surprisingly simple technique to design and analyze algorithms based on search trees, that significantly improves many existing results in the area of exact algorithms, using a combinatorial relation between the average and maximum dual degrees of a graph. Expand


Finding a Maximum Independent Set
An algorithm is presented which finds a maximum independent set in an n-vertex graph in 0($2^{n/3}$) time and can thus handle graphs roughly three times as large as could be analyzed using a naive algorithm. Expand
The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
Using polynomial interpolation techniques, it is shown that certain counting problems involving colourings of graphs and independent sets in hypergraphs are #P-complete and efficient approximate counting is the most one can realistically expect to achieve. Expand
An O(20.304n) Algorithm for Solving Maximum Independent Set Problem
  • Tang Jian
  • Mathematics, Computer Science
  • IEEE Trans. Computers
  • 1986
A faster algorithm for finding a maximum independent set in a graph is presented. The algorithm is an improved version of the one by Tarjan and Trojanowski [7]. A technique to further accelerate thisExpand
Algorithms for Maximum Independent Sets
  • J. Robson
  • Mathematics, Computer Science
  • J. Algorithms
  • 1986
Abstract An algorithm is presented which finds (the size of) a maximum independent set of an n vertex graph in time O (2 0.276 n ) improving on a previous bound of O(2 n 3 ) . The improvement comesExpand
The Complexity of Counting in Sparse, Regular, and Planar Graphs
  • S. Vadhan
  • Computer Science, Mathematics
  • SIAM J. Comput.
  • 2001
It is proved that the problems of counting matchings, vertex covers, independent sets, and extremal variants of these all remain hard when restricted to planar bipartite graphs of bounded degree or regular graphs of constant degree. Expand
Algorithms for Sat and Upper Bounds on Their Complexity
We survey recent algorithms for the propositional satisfiability problem. In particular, we consider algorithms having the best current worst-case upper bounds on their complexity. We also discussExpand
A Separator Theorem for Planar Graphs
Let G be any n-vertex planar graph. We prove that the vertices of G can be partitioned into three sets A, B, C such that no edge joins a vertex in A with a vertex in B, neither A nor B contains moreExpand
Greedy local improvement and weighted set packing approximation
An approximation algorithm for the weighted k-set packing problem is presented that combines the two paradigms by starting with an initial greedy solution and then repeatedly choosing the best possible local improvement, which is the first asymptotic improvement over the straightforward ratio of k. Expand
Finding maximum independent sets in sparse and general graphs
  • R. Beigel
  • Mathematics, Computer Science
  • SODA '99
  • 1999
The fastest MIS algorithms for sparse graphs and for graphs whose degree is bounded by 3 or by 4 are obtained, and the fastest MIS algorithm for bounded-degree graphs is obtained. Expand
Approximation algorithms for NP-complete problems on planar graphs
  • B. Baker
  • Mathematics, Computer Science
  • 24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
  • 1983
A general technique that can be used to obtain approximation algorithms for various NP-complete problems on planar graphs, which includes maximum independent set, maximum tile salvage, partition into triangles, maximum H-matching, minimum vertex cover, minimum dominating set, and minimum edge dominating set. Expand