Accelerating simulated annealing for the permanent and combinatorial counting problems
From MaRDI portal
Publication:3581599
DOI10.1145/1109557.1109656zbMath1192.90160OpenAlexW4244381242MaRDI QIDQ3581599
Vijay V. Vazirani, Eric Vigoda, Daniel Štefanković, Ivona Bezáková
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
Related Items (4)
Combinatorics of TCP reordering ⋮ An improved fully polynomial randomized approximation scheme (FPRAS) for counting the number of Hamiltonian cycles in dense digraphs ⋮ A dynamic programming approach to efficient sampling from Boltzmann distributions ⋮ Sampling binary contingency tables with a greedy start
This page was built for publication: Accelerating simulated annealing for the permanent and combinatorial counting problems
