Download:
|
by Peter Jonsson
in 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), ACM and SIAM, 2002
ftp://ftp.ida.liu.se/pub/labs/tcslab/petej/Conference/C21/C21.ps
Add To MetaCart
Abstract:
) algorithm for counting the number of independent sets with maximum weight in graphs. We show how this algorithm can be used for solving a number of dioeerent counting problems: counting exact covers, exact hitting sets, weighted set packing and satisfying assignments in 1-in-k SAT. 1
Citations
|
7709
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
293
|
Tarjan, A separator theorem for planar graphs
– Lipton, E
- 1979
|
|
233
|
Approximation algorithms for NP-complete problems on planar graphs
– Baker
- 1994
|
|
73
|
Algorithms for maximum independent sets
– Robson
- 1986
|
|
52
|
Finding a maximum independent set
– Tarjan, Trojanowski
- 1977
|
|
37
|
3-coloring in time O(1:3446 n ): a no-MIS algorithm
– Beigel, Eppstein
- 1995
|
|
31
|
Finding maximum independent sets in sparse and general graphs
– Beigel
- 1999
|
|
31
|
The complexity of counting in sparse, regular and planar graphs
– Vadhan
- 1979
|
|
22
|
E.: The good old Davis-Putnam procedure helps counting models
– Birnbaum, Lozinskii
- 1999
|
|
21
|
Stearns.The complexity of planar counting problems
– Marathe, Radhakrishnan, et al.
- 1998
|
|
20
|
An O(20:304n) algorithm for solving maximum independent set problem
– Jian
|
|
14
|
The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
– Greenhill
- 2000
|
|
10
|
Greedy local improvement and weighted set packing approximation
– Chandra, Halld'orsson
- 1995
|
|
8
|
Algorithms for SAT and upper bounds on their complexity
– Dantsin, Hirsch, et al.
- 2001
|
|
7
|
On the complexity of k-SAT
– Impagliazzo, Paturi
- 2001
|
|
2
|
Counting the number of solutions for instances of satisability
– Dubois
- 1991
|
|
2
|
On the complexity of counting satisfying assignments
– unknown authors
|
|
2
|
Number of models and satisability of sets of clauses
– Zhang
- 1996
|
