Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems
DOI10.1137/050644033zbMath1225.68270WikidataQ56341081 ScholiaQ56341081MaRDI QIDQ3532571
Vijay V. Vazirani, Eric Vigoda, Ivona Bezáková, Daniel Štefanković
Publication date: 28 October 2008
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050644033
68W40: Analysis of algorithms
05A15: Exact enumeration problems, generating functions
90C59: Approximation methods and heuristics in mathematical programming
60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
60J20: Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.)
68W25: Approximation algorithms
68W20: Randomized algorithms
Related Items