Accelerating simulated annealing for the permanent and combinatorial counting problems

Accelerating simulated annealing for the permanent and combinatorial counting problems Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems Ivona Bez´kov´ — a a Abstract We present an improved œcooling schedule  for simulated annealing algorithms for combinatorial counting problems. Under our new schedule the rate of cooling accelerates as the temperature decreases. Thus, fewer intermediate temperatures are needed as the simulated annealing algorithm moves from the high temperature (easy region) to the low temperature (di ƒcult region). We present applications of our technique to colorings and the permanent (perfect matchings of bipartite graphs). Moreover, for the permanent, we improve the analysis of the Markov chain underlying the simulated annealing algorithm. This improved analysis, combined with the faster cooling schedule, results in an O(n7 log4 n) time algorithm for approximating the permanent of a 0/1 matrix. 1 Introduction Simulated annealing is an important algorithmic approach for counting and sampling combinatorial structures. Two notable combinatorial applications are estimating the partition function of statistical physics models, and approximating the permanent of a non-negative matrix. For combinatorial counting problems, the general idea of simulated annealing is to write the desired quantity, say Z, (which is, for example, the number of colorings or matchings of an input graph) as a telescoping http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Accelerating simulated annealing for the permanent and combinatorial counting problems

Association for Computing Machinery — Jan 22, 2006

Loading next page...
/lp/association-for-computing-machinery/accelerating-simulated-annealing-for-the-permanent-and-combinatorial-oxwqSNEA5v
Datasource
Association for Computing Machinery
Copyright
Copyright © 2006 by ACM Inc.
ISBN
0-89871-605-5
Publisher site
See Article on Publisher Site

Abstract

Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems Ivona Bez´kov´ — a a Abstract We present an improved œcooling schedule  for simulated annealing algorithms for combinatorial counting problems. Under our new schedule the rate of cooling accelerates as the temperature decreases. Thus, fewer intermediate temperatures are needed as the simulated annealing algorithm moves from the high temperature (easy region) to the low temperature (di ƒcult region). We present applications of our technique to colorings and the permanent (perfect matchings of bipartite graphs). Moreover, for the permanent, we improve the analysis of the Markov chain underlying the simulated annealing algorithm. This improved analysis, combined with the faster cooling schedule, results in an O(n7 log4 n) time algorithm for approximating the permanent of a 0/1 matrix. 1 Introduction Simulated annealing is an important algorithmic approach for counting and sampling combinatorial structures. Two notable combinatorial applications are estimating the partition function of statistical physics models, and approximating the permanent of a non-negative matrix. For combinatorial counting problems, the general idea of simulated annealing is to write the desired quantity, say Z, (which is, for example, the number of colorings or matchings of an input graph) as a telescoping

There are no references for this article.

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off