{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T03:32:55Z","timestamp":1762918375214,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031496134"},{"type":"electronic","value":"9783031496141"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-49614-1_4","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T14:02:45Z","timestamp":1702044165000},"page":"56-80","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Highway Preferential Attachment Models for\u00a0Geographic Routing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-5931-771X","authenticated-orcid":false,"given":"Ofek","family":"Gila","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3260-2247","authenticated-orcid":false,"given":"Evrim","family":"Ozel","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8943-191X","authenticated-orcid":false,"given":"Michael","family":"Goodrich","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"issue":"5439","key":"4_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999). https:\/\/doi.org\/10.1126\/science.286.5439.509","journal-title":"Science"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Berger, N., Borgs, C., Chayes, J.T., D\u2019Souza, R.M., Kleinberg, R.D.: Competition-induced preferential attachment. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12\u201316, 2004. Proceedings. Lecture Notes in Computer Science, vol. 3142, pp. 208\u2013221. Springer (2004). https:\/\/doi.org\/10.1007\/978-3-540-27836-8_20","DOI":"10.1007\/978-3-540-27836-8_20"},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"Bollob\u00e1s, B., Riordan, O.M.: Mathematical results on scale-free random graphs. In: Bornholdt, S., Schuster, H.G. (eds.) Handbook of Graphs and Networks: From the Genome to the Internet, chap. 1, pp. 1\u201334. Wiley (2002). https:\/\/doi.org\/10.1002\/3527602755.ch1","DOI":"10.1002\/3527602755.ch1"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Borgs, C., Chayes, J.T., Daskalakis, C., Roch, S.: First to market is not everything: an analysis of preferential attachment with fitness. In: Johnson, D.S., Feige, U. (eds.) Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11\u201313, 2007, pp. 135\u2013144. ACM (2007). https:\/\/doi.org\/10.1145\/1250790.1250812","DOI":"10.1145\/1250790.1250812"},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Dodds, P.S., Muhamad, R., Watts, D.J.: An experimental study of search in global social networks. Science 301(5634), 827\u2013829 (2003). https:\/\/doi.org\/10.1126\/science.1081058, https:\/\/www.science.org\/doi\/abs\/10.1126\/science.1081058","DOI":"10.1126\/science.1081058"},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/s10955-010-9921-z","volume":"139","author":"S Dommers","year":"2010","unstructured":"Dommers, S., van der Hofstad, R., Hooghiemstra, G.: Diameters in preferential attachment models. J. Stat. Phys. 139(1), 72\u2013107 (2010). https:\/\/doi.org\/10.1007\/s10955-010-9921-z","journal-title":"J. Stat. Phys."},{"issue":"2","key":"4_CR7","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1080\/15427951.2006.10129124","volume":"3","author":"AD Flaxman","year":"2007","unstructured":"Flaxman, A.D., Frieze, A.M., Vera, J.: A geometric preferential attachment model of networks. Internet Math. 3(2), 187\u2013205 (2007). https:\/\/doi.org\/10.1080\/15427951.2006.10129124","journal-title":"Internet Math."},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Goodrich, M.T., Ozel, E.: Modeling the small-world phenomenon with road networks. In: Renz, M., Sarwat, M. (eds.) Proceedings of the 30th International Conference on Advances in Geographic Information Systems, SIGSPATIAL 2022, Seattle, Washington, November 1\u20134, 2022, pp. 46:1\u201346:10. ACM (2022). https:\/\/doi.org\/10.1145\/3557915.3560981","DOI":"10.1145\/3557915.3560981"},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Kleinberg, J.M.: The small-world phenomenon: an algorithmic perspective. In: Yao, F.F., Luks, E.M. (eds.) Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, May 21\u201323, 2000, Portland, OR, USA, pp. 163\u2013170. ACM (2000). https:\/\/doi.org\/10.1145\/335305.335325","DOI":"10.1145\/335305.335325"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Kumar, R., Liben-Nowell, D., Tomkins, A.: Navigating low-dimensional and hierarchical population networks. In: Azar, Y., Erlebach, T. (eds.) Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11\u201313, 2006, Proceedings. Lecture Notes in Computer Science, vol. 4168, pp. 480\u2013491. Springer (2006). https:\/\/doi.org\/10.1007\/11841036_44","DOI":"10.1007\/11841036_44"},{"issue":"33","key":"4_CR11","doi-asserted-by":"publisher","first-page":"11623","DOI":"10.1073\/pnas.0503018102","volume":"102","author":"D Liben-Nowell","year":"2005","unstructured":"Liben-Nowell, D., Novak, J., Kumar, R., Raghavan, P., Tomkins, A.: Geographic routing in social networks. Proc. Natl. Acad. Sci. U.S.A. 102(33), 11623\u201311628 (2005). https:\/\/doi.org\/10.1073\/pnas.0503018102","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"key":"4_CR12","doi-asserted-by":"publisher","unstructured":"Martel, C.U., Nguyen, V.: Analyzing Kleinberg\u2019s (and other) small-world models. In: Chaudhuri, S., Kutten, S. (eds.) Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John\u2019s, Newfoundland, Canada, July 25\u201328, 2004, pp. 179\u2013188. ACM (2004). https:\/\/doi.org\/10.1145\/1011767.1011794","DOI":"10.1145\/1011767.1011794"},{"issue":"1","key":"4_CR13","first-page":"61","volume":"1","author":"S Milgram","year":"1967","unstructured":"Milgram, S.: The small world problem. Psychol. Today 1(1), 61\u201367 (1967)","journal-title":"Psychol. Today"},{"issue":"2","key":"4_CR14","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1080\/15427951.2004.10129088","volume":"1","author":"M Mitzenmacher","year":"2004","unstructured":"Mitzenmacher, M.: A brief history of generative models for power law and lognormal distributions. Internet Math. 1(2), 226\u2013251 (2004)","journal-title":"Internet Math."},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"Slivkins, A.: Distance estimation and object location via rings of neighbors. In: Aguilera, M.K., Aspnes, J. (eds.) Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC 2005, Las Vegas, NV, USA, July 17\u201320, 2005, pp. 41\u201350. ACM (2005). https:\/\/doi.org\/10.1145\/1073814.1073823","DOI":"10.1145\/1073814.1073823"},{"issue":"4","key":"4_CR16","doi-asserted-by":"publisher","first-page":"425","DOI":"10.2307\/2786545","volume":"32","author":"J Travers","year":"1969","unstructured":"Travers, J., Milgram, S.: An experimental study of the small world problem. Sociometry 32(4), 425\u2013443 (1969)","journal-title":"Sociometry"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49614-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T09:02:49Z","timestamp":1707555769000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49614-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031496134","9783031496141"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49614-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawai, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOA2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"117","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}