Accelerating simulated annealing for the permanent and combinatorial counting problems

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 900-907

  Bezáková, Ivona ^a   Štefankovič, Daniel ^a   Vazirani, Vijay V ^b   Vigoda, Eric ^b  

^a THE UNIVERSITY OF CHICAGO   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COOLING SYSTEMS; MARKOV PROCESSES; PROBLEM SOLVING; SIMULATED ANNEALING; THERMAL EFFECTS;

COMBINATORIAL COUNTING PROBLEMS; COOLING SCHEDULE; SIMULATED ANNEALING ALGORITHM;

ALGORITHMS;

EID: 33244462008     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109656     Document Type: Conference Paper

References (18)

1. I. Bezáková, N. Bhatnagar, and E. Vigoda, Sampling Binary Contingency Tables with a Greedy Start, to appear in Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006.
2. A. Z. Broder, How hard is it to marry at random? (On the approximation of the permanent), Proceedings of the 18th Annual ACM Symposium on Theory of Computing (STOC), 1986, 50-58. Erratum in Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988, p. 551.
3. R. Bubley and M. Dyer, Path coupling: A technique for. proving rapid mixing in Markov chains. In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 223-231, 1997.
4. M.E. Dyer, A.M. Frieze and R. Kannan, A random polynomial time algorithm for approximating the volume of convex bodies, Journal of the Association for Computing Machinery, 38(1): 1-17, 1991.
5. T. Hayes, E. Vigoda, A Non-Markovian Coupling for Randomly Sampling Colorings. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 618-627, 2003.
6. M. Jerrum, A Very Simple Algorithm for Estimating the Number of k-Colorings of a Low-Degree Graph. Random Struct. Algorithms, 7(2):157-166, 1995.
7. M. Jerrum and A. Sinclair, Approximating the permanent, SIAM Journal on Computing, 18:1149-1178, 1989.
8. M.R. Jerrum, A. Sinclair and E. Vigoda, A polynomial- time approximation algorithm for the permanent of a matrix with non-negative entries. Journal of the Association for Computing Machinery, 51(4):671-697, 2004.
9. M. Jerrum, L. Valiant and V. Vazirani, Random generation of combinatorial structures from a uniform distribution, Theoretical Computer Science, 43:169-188, 1986.
10. M. Jerrum and U. Vazirani, A mildly exponential approximation algorithm for the permanent, Algorithmica, 16:392-401, 1996.
11. A. Kalai and S. Vempala, Simulated Annealing for Convex Optimization, Preprint.
12. P. W. Kasteleyn, The statistics of dimers on a lattice, I., The number of dimer arrangements on a quadratic lattice, Physica, 27:1664-1672, 1961.
13. S. Kirkpatrick, G. D. Gelatt Jr., and M. P. Vecchi, Optimization by Simulated Annealing, Science, 220:671-680, 1983.
14. 4) Volume Algorithm. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 650-659, 2003.
15. P. McCullagh, On prediction and density estimation, Preprint, 2004.
16. H. Pasula, S.J. Russell, M. Ostland, Y. Ritov, Tracking Many Objects with Many Sensors, Sixteenth International Joint Conference on Artificial Intelligence (IJCAI), 1160-1171, 1999.
17. A. Sinclair, Improved bounds for mixing rates of Markov chains and multicommodity flow, Combinatorics, Probability and Computing, 1:351-370, 1992.
18. L. G. Valiant, The complexity of computing the permanent, Theoretical Computer Science, 8:189-201, 1979.