Statistical mechanics of steiner trees

Physical Review Letters

Volumn 101, Issue 3, 2008, Pages

  Bayati, M ^a   Borgs, C ^a   Braunstein, A ^b   Chayes, J ^a   Ramezanpour, A ^c   Zecchina, R ^b  

^a MICROSOFT RESEARCH   (United States)

^b POLITECNICO DI TORINO   (Italy)

^c ABDUS SALAM INTERNATIONAL CENTRE FOR THEORETICAL PHYSICS   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; GRAPH THEORY; KETONES; OPTIMIZATION; SPEED; STATISTICAL MECHANICS; STATISTICAL METHODS; TREES (MATHEMATICS);

AMERICAN PHYSICAL SOCIETY (APS); COMBINATORIAL OPTIMIZATION PROBLEMS; GLOBAL CONNECTIVITY; MECHANICS PROPERTIES; MINIMUM WEIGHT; OPTIMIZATION ALGORITHMS; RANDOM GRAPHS; STEINER TREES; WIDE-RANGE;

MECHANICS;

EID: 47949124922     PISSN: 00319007     EISSN: 10797114     Source Type: Journal    
DOI: 10.1103/PhysRevLett.101.037208     Document Type: Article

References (18)

1. R. Karp, Complexity of Computer Computations, IBM Research Symposia Series Vol. 43, edited by, R.E. Miller, and, J.W. Thatcher, (Plenum Press, New York, 1972), p. 85.
2. G. Robins and A. Zelikovsky, in Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SIAM, San Francisco, 2000), pp. 770-779.
3. M. Durand Phys. Rev. Lett. 98, 088701 (2007). PRLTAO 0031-9007 10.1103/PhysRevLett.98.088701
4. A. Braunstein, M. Mzard, and R. Zecchina, Random Struct. Algorithms 27, 201 (2005). RSALFD 1042-9832 10.1002/rsa.20057
5. M. Mezard, G. Parisi, and R. Zecchina, Science 297, 812 (2002). SCIEAS 0036-8075 10.1126/science.1073287
6. A. Braunstein and R. Zecchina, Phys. Rev. Lett. 96, 030201 (2006). PRLTAO 0031-9007 10.1103/PhysRevLett.96.030201
7. B. Frey and D. Dueck, Science 315, 972 (2007). SCIEAS 0036-8075 10.1126/science.1136800
8. A. Braunstein, R. Mulet, A. Pagnani, M. Weigt, and R. Zecchina, Phys. Rev. E 68, 036702 (2003). PLEEE8 1063-651X 10.1103/PhysRevE.68.036702
9. C. Di, A. Montanari, and R. Urbanke, in Proceedings of the International Symposium on Information Theory (ISIT, Chicago, 2004).
10. F. Krzakal, A. Montanari, F. Ricci-Tersenghi, G. Semerjian, and L. Zdeborova, Proc. Natl. Acad. Sci. U.S.A. 104, 10318 (2007). PNASA6 0027-8424 10.1073/pnas.0703685104
11. A. Frieze, Discrete Appl. Math. 10, 47 (1985). DAMADU 0166-218X 10.1016/0166-218X(85)90058-7
12. D. Gamarnik, in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SIAM, Vancouver, 2005), pp. 700-704.
13. L. Addario-Berry, N. Broutin, and B. Reed, in Proceedings, Fourth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities (DMTCS, Nancy, 2006).
14. O. Angel, A. Flaxman, D. Wilson, and R. Zecchina, " Bounded Depth Minimum Steiner Trees " (unpublished).
15. D. Aldous, Random Struct. Algorithms 18, 381 (2001). RSALFD 1042-9832 10.1002/rsa.1015
16. B. Bollobs, D. Gamarnik, O. Riordan, and B. Sudakov, Combinatorica 24, 187 (2004). COMBDI 0209-9683 10.1007/s00493-004-0013-z
17. M. Mezard and G. Parisi, Europhys. Lett. 2, 913 (1986). EULEEJ 0295-5075 10.1209/0295-5075/2/12/005
18. M. Mezard and G. Parisi, Eur. Phys. J. B 20, 217 (2001). EPJBFY 1434-6028 10.1007/PL00011099