A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries

Journal of the ACM

Volumn 51, Issue 4, 2004, Pages 671-697

  Jerrum, Mark ^a   Sinclair, Alistair ^b,d   Vigoda, Eric ^c,e  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF CHICAGO   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

^e THE UNIVERSITY OF CHICAGO   (United States)

Author keywords

Markov chain Monte Carlo; Permanent of a matrix; Rapidly mixing Markov chains

Indexed keywords

PERMANENT OF A MATRIX; PROBABILISTIC ALGORITHMS; RAPIDLY MIXING MARKOV CHAINS;

ALGORITHMS; APPROXIMATION THEORY; MARKOV PROCESSES; MONTE CARLO METHODS; POLYNOMIALS; PROBLEM SOLVING;

MATRIX ALGEBRA;

EID: 4243139497     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/1008731.1008738     Document Type: Article

References (26)

1. ALDOUS, D. 1987. On the Markov chain simulation method for uniform combinatorial distributions and simulated annealing. Prob. Eng. Inf. Sci. 1, 33-46.
2. ALON, N., AND SPENCER, J. 1992. The Probabilistic Method. Wiley, New York.
3. BARVINOK, A. 1999. Polynomial time algorithms to approximate permanents and mixed discriminants within a simply exponential factor. Ran. Struct. Algor. 14, 29-61.
4. BRODER, A. Z. 1986. How hard is it to marry at random? (On the approximation of the permanent). In Proceedings of the 18th Annual ACM Symposium on Theory of Computing (STOC), ACM, New York, 50-58. (Erratum in Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988, p. 551.)
5. CHIEN, S., RASMUSSEN, L., AND SINCLAIR, A. 2002. Clifford algebras and approximating the permanent. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing, ACM, New York, 222-231.
6. DIACONIS, P., AND SALOFF-COSTE, L. 1993. Comparison theorems for reversible Markov chains. Ann. Appl. Prob. 3, 696-730.
7. DIACONIS, P., AND STROOCK, D. 1991. Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Prob, 1, 36-61.
8. GILLMAN, D. 1998. A Chernoff bound for random walks on expander graphs. SIAM J. Comput. 27, 1203-1220.
9. JERRUM, M. 2003. Counting, sampling and integrating: Algorithms and complexity. In Lectures in Mathematics-ETH Zürich. Birkhäuser, Basel.
10. JERRUM, M., AND SINCLAIR, A. 1989. Approximating the permanent. SIAM J. Comput. 18, 1149-1178.
11. JERRUM, M., AND SINCLAIR, A. 1990. Fast uniform generation of regular graphs. Theoret. Comput. Sci. 73, 91-100.
12. JERRUM, M., AND SINCLAIR, A. 1996. The Markov chain Monte Carlo method: An approach to approximate counting and integration. In Approximation Algorithms for NP-hard Problems (Dorit Hochbaum, ed.). PWS Publishing, 482-520.
13. JERRUM, M., VALIANT, L., AND VAZIRANI, V. 1986. Random generation of combinatorial structures from a uniform distribution. Theoret. Comput. Sci. 43, 169-188.
14. JERRUM, M., AND VAZIRANI, U. 1996. A mildly exponential approximation algorithm for the permanent. Algorithmica 16, 392-401.
15. KASTELEYN, P. W. 1961. The statistics of dimers on a lattice, I., The number of dimer arrangements on a quadratic lattice. Physica 27, 1664-1672.
16. KENYON, C., RANDALL, D., AND SINCLAIR, A. 1996. Approximating the number of dimer coverings of a lattice. J. Stat. Phys. 83, 637-659.
17. LEZAUD, P. 1998. Chemoff-type bounds for finite Markov chains. Ann. Appl. Prob. 8, 849-867.
18. LINIAL, N., SAMORODNITSKY, A., AND WIGDERSON, A. 2000. A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents. Combinatorica 20, 545-568.
19. MIHAIL, M., AND WINKLER, P. 1992. On the number of Eulerian orientations of a graph. In Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, 138-145.
20. MINC, H. 1982. Permanents. Encyclopedia of Mathematics and Its Applications Vol. 6, Addison-Wesley, Reading, Mass.
21. MOTWANI, R., AND RAGHAVAN, P. 1995. Randomized Algorithms. Cambridge University Press, Cambridge, Mass.
22. RYSER, H. J. 1963. Combinatorial Mathematics. The Carus Mathematical Monographs No. 14, Mathematical Association of America.
23. 2) bound for the relaxation time of a Markov chain on cladograms. Rand. Struct. Algor. 20, 59-70.
24. SINCLAIR, A. 1992. Improved bounds for mixing rates of Markov chains and multicommodity flow. Combinatorics, Probability and Computing 1, 351-370.
25. TUTTE, W. T. 1954. A short proof of the factor theorem for finite graphs. Canad. J. Math. 6, 347-352.
26. VALIANT, L. G. 1979. The complexity of computing the permanent. Theoret. Comput. Sci. 8, 189-201.