Accelerating simulated annealing for the permanent and combinatorial counting problems

DOI10.1145/1109557.1109656MaRDI QIDQ3581599zbMATH OpenOpenAlexFDO

Authors Ivona Bezáková, D. Štefankovič, Vijay V. Vazirani, Eric Vigoda

Publication date 16 August 2010

Published in Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1109557.1109656

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Combinatorial optimization (90C27)

Cited in

(4)

• A dynamic programming approach to efficient sampling from Boltzmann distributions
• Sampling binary contingency tables with a greedy start
• An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs
• Combinatorics of TCP reordering

This page was built for publication: Accelerating simulated annealing for the permanent and combinatorial counting problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581599)