Simple deterministic approximation algorithms for counting matchings

@inproceedings{Bayati2007SimpleDA,
  title={Simple deterministic approximation algorithms for counting matchings},
  author={Mohsen Bayati and David Gamarnik and Dimitriy A. Katz and Chandra Nair and Prasad Tetali},
  booktitle={STOC},
  year={2007}
}
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… CONTINUE READING
Highly Influential
This paper has highly influenced 13 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 77 extracted citations

Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials

Electronic Notes in Discrete Mathematics • 2017
View 5 Excerpts
Highly Influenced

A distributed deterministic approximation algorithm for data association

2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS) • 2011
View 9 Excerpts
Highly Influenced

A Simple FPTAS for Counting Edge Covers

View 5 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…