Random generation of combinatorial structures from a uniform
Theoretical Computer Science
Algorithms for random generation and counting: a Markov chain approach
Algorithms for random generation and counting: a Markov chain approach
The Markov chain Monte Carlo method: an approach to approximate counting and integration
Approximation algorithms for NP-hard problems
The Complexity of Counting in Sparse, Regular, and Planar Graphs
SIAM Journal on Computing
On the absence of phase transition in the monomer-dimer model
On the absence of phase transition in the monomer-dimer model
Glauber Dynamics onTrees and Hyperbolic Graphs
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
Journal of the ACM (JACM)
Mixing in time and space for lattice spin systems: A combinatorial view
Random Structures & Algorithms - Isaac Newton Institute Programme “Computation, Combinatorics and Probability”: Part II
Strong Spatial Mixing with Fewer Colors for Lattice Graphs
SIAM Journal on Computing
Counting without sampling: new algorithms for enumeration problems using statistical physics
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Counting independent sets up to the tree threshold
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Correlation decay and deterministic FPTAS for counting list-colorings of a graph
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A deterministic approximation algorithm for computing the permanent of a 0,1 matrix
Journal of Computer and System Sciences
Fully polynomial time approximation schemes for stochastic dynamic programs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Sequential cavity method for computing limits of the log-partition function for lattice models
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Optimization and NP_R-completeness of certain fewnomials
Proceedings of the 2009 conference on Symbolic numeric computation
Approximating the volume of unions and intersections of high-dimensional geometric objects
Computational Geometry: Theory and Applications
A deterministic approximation algorithm for computing the permanent of a 0,1 matrix
Journal of Computer and System Sciences
PTAS for maximum weight independent set problem with random weights in bounded degree graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximate counting via correlation decay in spin systems
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Correlation decay and deterministic FPTAS for counting colorings of a graph
Journal of Discrete Algorithms
A Deterministic Polynomial-Time Approximation Scheme for Counting Knapsack Solutions
SIAM Journal on Computing
A randomized approximation algorithm for parameterized 3-D matching counting problem
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |
We construct a deterministic fully polynomial time approximationscheme (FPTAS) for computing the total number of matchings in abounded degree graph. Additionally, for an arbitrary graph, weconstruct a deterministic algorithm for computing approximately thenumber of matchings within running time exp(O(√n log2n)),where n is the number of vertices. Our approach is based on the correlation decay technique originating in statistical physics. Previously thisapproach was successfully used for approximately counting thenumber of independent sets and colorings in some classes of graphs [1, 24, 6].Thus we add another problem to the small, but growing, class of P-complete problems for whichthere is now a deterministic FPTAS.