{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T06:59:50Z","timestamp":1761893990950,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,7,25]],"date-time":"2004-07-25T00:00:00Z","timestamp":1090713600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,7,25]]},"DOI":"10.1145\/1011767.1011795","type":"proceedings-article","created":{"date-parts":[[2004,10,7]],"date-time":"2004-10-07T17:39:48Z","timestamp":1097170788000},"page":"189-196","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphs"],"prefix":"10.1145","author":[{"given":"Jie","family":"Gao","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA"}]},{"given":"Li","family":"Zhang","sequence":"additional","affiliation":[{"name":"HP Labs, Palo Alto, CA"}]}],"member":"320","published-online":{"date-parts":[[2004,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"M. Andrews D. Bhatia T. Leighton F. Makedon C. H. Norton and L. Zhang. Improved algorithms for routing on two-dimensional grids. Unpublished.  M. Andrews D. Bhatia T. Leighton F. Makedon C. H. Norton and L. Zhang. Improved algorithms for routing on two-dimensional grids. Unpublished."},{"key":"e_1_3_2_1_2_1","first-page":"534","volume-title":"Proc. 44th Symposium on Foundations of Computer Science (FOCS '03)","author":"Anupam Gupta R. K.","year":"2003"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167248"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1993.366884"},{"key":"e_1_3_2_1_5_1","first-page":"178","volume-title":"On-line Algorithms: The State of the Art","author":"Azar Y.","year":"1998"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.35831"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00025-0"},{"volume-title":"Cambridge University Press","year":"1998","author":"Borodin A.","key":"e_1_3_2_1_8_1"},{"volume-title":"MIT Press","year":"1994","author":"Cormen T. H.","key":"e_1_3_2_1_9_1"},{"volume-title":"J.-R","year":"2000","author":"Eppstein D.","key":"e_1_3_2_1_10_1"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-003-2925-6"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/501422.501424"},{"volume-title":"Proc. IEEE INFOCOM'04","year":"2004","author":"Gao J.","key":"e_1_3_2_1_13_1"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2002.1028873"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016627727877"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510013"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780607"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01215349"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90163-5"},{"key":"e_1_3_2_1_20_1","first-page":"1268","volume-title":"IEEE INFOCOM","author":"Li X.-Y.","year":"2002"},{"volume-title":"Addison-Wesley","year":"1980","author":"Mead C.","key":"e_1_3_2_1_21_1"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/564870.564910"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019258"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/258492.258523"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90003-7"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22154"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/646340.686566"}],"event":{"name":"PODC04: Principles of Distributed Computing 2004","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"St. John's Newfoundland Canada","acronym":"PODC04"},"container-title":["Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1011767.1011795","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1011767.1011795","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T20:13:41Z","timestamp":1748895221000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1011767.1011795"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,7,25]]},"references-count":27,"alternative-id":["10.1145\/1011767.1011795","10.1145\/1011767"],"URL":"https:\/\/doi.org\/10.1145\/1011767.1011795","relation":{},"subject":[],"published":{"date-parts":[[2004,7,25]]},"assertion":[{"value":"2004-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}