Statistical Mechanics of Steiner trees
Statistical Mechanics
2009-11-13 v1 Disordered Systems and Neural Networks
Abstract
The Minimum Weight Steiner Tree (MST) is an important combinatorial optimization problem over networks that has applications in a wide range of fields. Here we discuss a general technique to translate the imposed global connectivity constrain into many local ones that can be analyzed with cavity equation techniques. This approach leads to a new optimization algorithm for MST and allows to analyze the statistical mechanics properties of MST on random graphs of various types.
Keywords
Cite
@article{arxiv.0807.3373,
title = {Statistical Mechanics of Steiner trees},
author = {M. Bayati and C. Borgs and A. Braunstein and J. Chayes and A. Ramezanpour and R. Zecchina},
journal= {arXiv preprint arXiv:0807.3373},
year = {2009}
}