A mildly exponential approximation algorithm for the permanent

@article{Jerrum1996AME,
  title={A mildly exponential approximation algorithm for the permanent},
  author={Mark Jerrum and Umesh V. Vazirani},
  journal={Algorithmica},
  year={1996},
  volume={16},
  pages={392-401}
}
A new approximation algorithm for the permanent of ann ×n 0,1-matrix is presented. The algorithm is shown to have worst-case time complexity exp(O(n 1/2 log2 n)). Asymptotically, this represents a considerable improvement over the best existing algorithm, which has worst-case time complexity exp(Θ(n)). 

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 15 references

An analysis of a Monte Carlo algorithm for estimating the permanent

M. Jerrum
Proceedings of the 3rd Conference on Integer Programming and Combinatorial Optimization • 1993
View 1 Excerpt

L

N. Karmarkar, R. Karp, R. Lipton
Lov ́ asz, and M. Luby, A Monte-Carlo algorithm for estimating the permanent. SIAM Journal on Computing , 22 • 1993
View 1 Excerpt

On "The Matching Polynomial of a Polygraph"

Discrete Applied Mathematics • 1993
View 2 Excerpts

Random Generation and Counting : a Markov Chain Approach

A. Sinclair, Algorithms
1993
View 1 Excerpt

Approximating the Permanent

SIAM J. Comput. • 1989
View 10 Excerpts

Randomised Algorithms for Counting and Generating Combinatorial Structures

A. Sinclair
Ph.D. Thesis, • 1988
View 1 Excerpt

A Monte - Carlo algorithm for estimating the permanent

R. Karp N. Karmarkar, R. Lipton
SIAM Journal on Computing • 1986

Matching Theory

L. Lovász, M. D. Plummer
North-Holland, Amsterdam • 1986
View 1 Excerpt

Similar Papers

Loading similar papers…