From the physics of interacting polymers to optimizing routes on the London Underground

Proceedings of the National Academy of Sciences of the United States of America

Volumn 110, Issue 34, 2013, Pages 13717-13722

  Yeung, Chi Ho ^a   Saad, David ^a   Michael Wong, K Y ^b  

^a ASTON UNIVERSITY   (United Kingdom)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

POLYMER;

ALGORITHM; ARTICLE; INTERNET; INTERPERSONAL COMMUNICATION; PHASE TRANSITION; PHYSICS; PRIORITY JOURNAL; QUANTITATIVE STUDY; TEMPERATURE; UNITED KINGDOM;

ALGORITHMS; AVIATION; INTERNET; MODELS, THEORETICAL; POLYMERS; RAILROADS; SYSTEMS THEORY;

EID: 84882762337     PISSN: 00278424     EISSN: 10916490     Source Type: Journal    
DOI: 10.1073/pnas.1301111110     Document Type: Article

References (40)

1. Huitema C (1995) Routing in the Internet (Prentice Hall, Englewood Cliffs, NJ).
2. Moy JT (1998) OSPF: Anatomy of an Internet Routing Protocol (Addison-Wesley, Reading, MA).
3. Vasan A, Simonovic SP (2010) Optimization of water distribution network design using differential evolution. Journal ofWater Resources Planning andManagement 136:279-287.
4. Rangwala S, Gummadi R, Govindan R, Psounis K (2006) Interference-aware fair rate control in wireless sensor networks. Computer Communication Review 36:63-74.
5. Chardaire P, McKeown GP, Verity-Harrison SA, Richardson SB (2005) Solving a timespace network formulation for the convoy movement problem. Operations Research 53(2):219-230.
6. Beckmann M, McGuire CB, Winsten CB (1956) Studies in the Economics of Transportation (Yale Univ Press, New Haven).
7. Wardrop JG (1952) Some theoretical aspects of road traffic research. Proceedings of the Institute of Civil Engineers 1(Part II):325-378.
8. Bellman R (1958) On a routing problem. Quarterly of Applied Mathematics 16(1):87-90.
9. Dijkstra EW (1959) A note on two problems in connexion with graphs. Numerische Mathematik 1:269-271.
10. Xie H, Qiu L, Yang YR, Zhang Y (2004) On self adaptive routing in dynamic environments, Proceedings of the 12th IEEE International Conference on Network Protocols (IEEE, Washington, DC), pp 12-23.
11. Zhu Y, Dovrolis C, Ammar M (2006) Dynamic overlay routing based on available bandwidth estimation: A simulation study. Computer Networks Journal 50:739-876.
12. Baliga J, Hinton K, Tucker RS (2007) Energy consumption of the Internet. Proceedings of the Conference on Optical Internet and the 32nd Australian Conference on Optical Fibre Technology (IEEE, Washington, DC), pp 1-3.
13. Shahrokhi F, Matula DW (1990) The maximum concurrent flow problem. Journal of the Association for Computing Machinery 37:318-334.
14. Leighton T, Rao S (1988) An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. Proceedings of Foundations of Computer Science 29th Annual Symposium (IEEE, Washington, DC), pp 422-431.
15. Awerbuch B, Azar Y, Plotkin S (1993) Throughput-competitive on-line routing. Proceedings of Foundations of Computer Science 34th Annual Symposium (IEEE, Washington, DC), pp 32-40.
16. Garg N, Könemann J (1998) Faster and simpler algorithms for multicommodity flow and other fractional packing problems. Proceedings of Foundations of Computer Science 39th Annual Symposium (IEEE, Washington, DC), pp 300-309.
17. Awerbuch B, Khandekar R (2007) Greedy distributed optimization of multi-commodity flows. Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing (ACM, New York), pp 274-283.
18. Barnhart C, Hane CA, Vance PH (2000) Using branch-and-price-and-cut to solve origin destination integer multicommodity flow problems. Oper Res 48:318-326.
19. Castro J, Nabona N (1996) An implementation of linear and nonlinear multicommodity network flows. Eur J Oper Res 92:37-53.
20. Daoud M, et al. (1975) Solutions of flexible polymers. Neutron experiments and interpretation. Macromolecules 8(6):804-818.
21. Mézard M, Parisi G, Virasoro MA (1987) Spin Glass Theory and Beyond (World Scientific, Singapore).
22. Nishimori H (2001) Statistical Physics of Spin Glasses and Information Processing (Oxford Univ Press, Oxford, UK).
23. Pearl J (1982) Reverend Bayes on inferenced engines: A distributed hierarchical approach. Proceedings of the Second National Conference on Artificial Intelligence (AAAI, San Francisco), pp 133-136.
24. Gallager RG (1998) Information Theory and Reliable Communication (Wiley, NY).
25. Barash Y, et al. (2010) Deciphering the splicing code. Nature 465(7294):53-59.
26. Mézard M, Parisi G, Zecchina R (2002) Analytic and algorithmic solution of random satisfiability problems. Science 297(5582):812-815.
27. Liu YY, Slotine JJ, Barabási AL (2011) Controllability of complex networks. Nature 473(7346):167-173.
28. Bohn S, Magnasco MO (2007) Structure, scaling, and phase transition in the optimal transport network. Phys Rev Lett 98(8):088702.
29. Banavar JR, Colaiori F, Flammini A, Maritan A, Rinaldo A (2000) Topology of the fittest transportation network. Phys Rev Lett 84(20):4745-4748.
30. Shao Z, Zhou H (2007) Optimal transportation network with concave cost functions: Loop analysis and algorithms. Phys Rev E Stat Nonlin Soft Matter Phys 75(6 Pt 2): 066112.
31. Batchelor MT, Nienhuis B, Warnaar SO (1989) Bethe-Ansatz results for a solvable O(n) model on the square lattice. Phys Rev Lett 62(21):2425-2428.
32. Stilck JF, Machado KD, Serra P (1996) Nature of the collapse transition for polymers. Phys Rev Lett 76(15):2734-2737.
33. Mézard M, Montanari A (2009) Information, Physics, and Computation (Oxford Univ Press, Oxford, UK).
34. Yeung CH, Saad D (2012) Competition for shortest paths on sparse graphs. Phys Rev Lett 108(20):208701.
35. Transport for London, Oyster card data. Available at www.tfl.gov.uk. Accessed April 16, 2012.
36. Openflights.org, Airport network data. Available at http://openflights. org/data.html. Accessed April 12, 2012.
37. Newman MEJ, Strogatz SH, Watts DJ (2001) Random graphs with arbitrary degree distributions and their applications. Phys Rev E Stat Nonlin Soft Matter Phys 64(2 Pt 2): 026118.
38. Kim M, Medard M (2004) Robustness in large-scale random networks. Proceedings of the IEEE Infocom Conference. 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE, Washington, DC), pp 2364-2373.
39. Bollobás B (1985) Random Graphs (Academic, London).
40. Borgatti SP (2002) NetDraw Software for Network Visualization. Analytic Technologies: Lexington, KY.