<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Mohsen Bayati</style></author><author><style face="normal" font="default" size="100%">Borgs, Christian</style></author><author><style face="normal" font="default" size="100%">Braunstein, A.</style></author><author><style face="normal" font="default" size="100%">Chayes, Jennifer</style></author><author><style face="normal" font="default" size="100%">Ramezanpour, A.</style></author><author><style face="normal" font="default" size="100%">Zecchina, Riccardo</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Statistical Mechanics of Steiner Trees</style></title><secondary-title><style face="normal" font="default" size="100%">Physical Review Letters</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">biocomp</style></keyword><keyword><style  face="normal" font="default" size="100%">networks</style></keyword><keyword><style  face="normal" font="default" size="100%">optimization</style></keyword><keyword><style  face="normal" font="default" size="100%">statphys</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://arxiv.org/abs/0807.3373</style></url></web-urls><related-urls><url><style face="normal" font="default" size="100%">http://areeweb.polito.it/ricerca/cmp/sites/default/files/prl-steiner.pdf</style></url></related-urls></urls><number><style face="normal" font="default" size="100%">3</style></number><publisher><style face="normal" font="default" size="100%">APS</style></publisher><volume><style face="normal" font="default" size="100%">101</style></volume><pages><style face="normal" font="default" size="100%">37208</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">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. </style></abstract></record></records></xml>