{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T06:56:05Z","timestamp":1770274565596,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540438649","type":"print"},{"value":"9783540454656","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45465-9_11","type":"book-chapter","created":{"date-parts":[[2007,5,27]],"date-time":"2007-05-27T01:12:57Z","timestamp":1180228377000},"page":"110-122","source":"Crossref","is-referenced-by-count":103,"title":["Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet"],"prefix":"10.1007","author":[{"given":"Alex","family":"Fabrikant","sequence":"first","affiliation":[]},{"given":"Elias","family":"Koutsoupias","sequence":"additional","affiliation":[]},{"given":"Christos H.","family":"Papadimitriou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,6,25]]},"reference":[{"issue":"3","key":"11_CR1","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1002\/rsa.1009","volume":"18","author":"B. Bollob\u00e1s","year":"2001","unstructured":"B\u00e9la Bollob\u00e1s, Oliver Riordan, Joel Spencer, and G\u00e1bor Tusn\u00e1dy. The degree sequence of a scale-free random graph process. Random Structures and Algorithms, 18(3):279\u2013290, 2001.","journal-title":"Random Structures and Algorithms"},{"issue":"2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"1412","DOI":"10.1103\/PhysRevE.60.1412","volume":"60","author":"J. M. Carlson","year":"1999","unstructured":"J. M. Carlson and J. Doyle. Highly optimized tolerance: a mechanism for power laws in designed systems. Physics Review E, 60(2):1412\u20131427, 1999.","journal-title":"Physics Review E"},{"key":"11_CR3","unstructured":"Manuel Castells. The Internet Galaxy: Re ections on the Internet, Business, and Society. Oxford, 2001. http:\/\/www.oup.co.uk\/isbn\/0-19-924153-8 ."},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Colin Cooper and Alan M. Frieze. A general model of undirected web graphs. In ESA, pages 500\u2013511, 2001.","DOI":"10.1007\/3-540-44676-1_42"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"C. Faloutsos, M. Faloutsos, and P. Faloutsos. On power-law relationships of the internet topology. In Proc. SIGCOMM, 1999.","DOI":"10.1145\/316188.316229"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1162\/003355399556133","volume":"114","author":"X. Gabaix","year":"1999","unstructured":"X. Gabaix. Zipf\u2019s law for cities: an explanation. Quarterly Journal of Economics, 114:739\u2013767, 1999.","journal-title":"Quarterly Journal of Economics"},{"key":"11_CR7","unstructured":"R. Govindan. Private communication."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal. Stochastic models for the web graph. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pages 57\u201365, 2000.","DOI":"10.1109\/SFCS.2000.892065"},{"key":"11_CR9","unstructured":"R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Extracting large scale knowledge bases from the Web. In Proceedings of the 25th VLDB Conference, 1999."},{"key":"11_CR10","unstructured":"B. Mandlebrot. An informational theory of the statistical structure of languages. In W. Jackson, editor, Communication theory, pages 486\u2013502. Betterworth, 1953."},{"key":"11_CR11","unstructured":"M. Mihail and C. Papadimitriou. Power law distribution of the Internet eigenvalues: An explanation. Unpublished."},{"key":"11_CR12","unstructured":"M. Mitzenmacher. A brief history of generative models for power law and lognormal distributions. Manuscript."},{"key":"11_CR13","unstructured":"V. Pareto. Cours d\u2019Economie Politique. Dronz, Geneva Switzerland, 1896."},{"key":"11_CR14","unstructured":"H. Tangmunarunkit, R. Govindan, S. Jamin, S. Shenker, and W. Willinger. Network topologies, power laws, and hierarchy. Technical Report 01-746, Computer Science Department, University of Southern California, 2001. To appear in Computer Communication Review."},{"key":"11_CR15","volume-title":"Human behavior and the principle of least effort","author":"G. Zipf","year":"1949","unstructured":"G. Zipf. Human behavior and the principle of least effort. Addison-Wesley, Cambridge MA, 1949."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45465-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T11:05:32Z","timestamp":1556449532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45465-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438649","9783540454656"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45465-9_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}