Simulated Annealing; Permanent and Contingency Tables
-
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
D. Stefankovic, S. Vempala, and E. Vigoda
FOCS 2007.
Download full version from arXiv -
Sampling Binary Contingency Tables with a Greedy Start.
I. Bezakova, N. Bhatnagar, and E. Vigoda
Random Structures and Algorithms, 30(1-2):168-205, 2007.
Preliminary version in SODA 2006.
Download: PDF (Short SODA version: PDF) -
Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems.
I. Bezakova, D. Stefankovic, V. Vazirani, and E. Vigoda
SIAM Journal of Computing, 37(5):1429-1454, 2008.
Preliminary version in SODA 2006.
Download: PDF (Short SODA version: PDF) -
A polynomial-time approximation algorithm for the permanent of a matrix
with non-negative entries.
M. Jerrum, A. Sinclair, and E. Vigoda
Journal of the ACM, 51(4):671-697, 2004.
A preliminary version appears in STOC 2001.
Fulkerson prize, 2006.
Download: PDF