{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:24:38Z","timestamp":1750307078876,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,8,17]],"date-time":"2012-08-17T00:00:00Z","timestamp":1345161600000},"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":[[2012,8,17]]},"DOI":"10.1145\/2342549.2342559","type":"proceedings-article","created":{"date-parts":[[2012,8,21]],"date-time":"2012-08-21T13:06:35Z","timestamp":1345554395000},"page":"37-42","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Shortest paths in less than a millisecond"],"prefix":"10.1145","author":[{"given":"Rachit","family":"Agarwal","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Caesar","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philip Brighten","family":"Godfrey","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ben Y.","family":"Zhao","sequence":"additional","affiliation":[{"name":"University of California Santa Barbara, Santa Barbara, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,8,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934973"},{"key":"e_1_3_2_1_2_1","first-page":"710","volume-title":"International Conference on Very Large Databases (VLDB)","author":"Amer-Yahia S.","year":"2008","unstructured":"S. Amer-Yahia , M. Benedikt , L. V. Lakshmanan , and J. Stoyanovic . Efficient network-aware search in collaborative tagging sites . In International Conference on Very Large Databases (VLDB) , pages 710 -- 721 , 2008 . S. Amer-Yahia, M. Benedikt, L. V. Lakshmanan, and J. Stoyanovic. Efficient network-aware search in collaborative tagging sites. In International Conference on Very Large Databases (VLDB), pages 710--721, 2008."},{"key":"e_1_3_2_1_3_1","first-page":"156","volume-title":"ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Goldberg A.","year":"2005","unstructured":"A. Goldberg and C. Harrelson . Computing the shortest path: A$^\\star$ meets graph theory . In ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 156 -- 165 , 2005 . A. Goldberg and C. Harrelson. Computing the shortest path: A$^\\star$ meets graph theory. In ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 156--165, 2005."},{"key":"e_1_3_2_1_4_1","volume-title":"ACM-SIAM Workshop on Algorithm Engineering and Experiments (ALENEX)","author":"Goldberg A.","year":"2006","unstructured":"A. Goldberg , H. Kaplan , and R. Werneck . Reach for A$^\\star$: Efficient point-to-point shortest path algorithms . In ACM-SIAM Workshop on Algorithm Engineering and Experiments (ALENEX) , 2006 . A. Goldberg, H. Kaplan, and R. Werneck. Reach for A$^\\star$: Efficient point-to-point shortest path algorithms. In ACM-SIAM Workshop on Algorithm Engineering and Experiments (ALENEX), 2006."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871503"},{"key":"e_1_3_2_1_6_1","unstructured":"http:\/\/academic.research.microsoft.com\/.  http:\/\/academic.research.microsoft.com\/."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1855013"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"e_1_3_2_1_10_1","unstructured":"NYTimes: http:\/\/alturl.com\/j2ygi.  NYTimes: http:\/\/alturl.com\/j2ygi."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646063"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718537"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367586"},{"key":"e_1_3_2_1_14_1","unstructured":"Stanford Large Network Dataset Collection: http:\/\/snap.stanford.edu\/data\/index.html.  Stanford Large Network Dataset Collection: http:\/\/snap.stanford.edu\/data\/index.html."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1397735.1397737"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1044731.1044732"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063834"},{"key":"e_1_3_2_1_18_1","unstructured":"http:\/\/dblp.uni-trier.de\/xml\/ 2012.  http:\/\/dblp.uni-trier.de\/xml\/ 2012."},{"key":"e_1_3_2_1_19_1","volume-title":"ACM Workshop on Online Social Networks (WOSN)","author":"Zhao X.","year":"2010","unstructured":"X. Zhao , A. Sala , C. Wilson , H. Zheng , and B. Y. Zhao . Orion: Shortest path estimation for large social graphs . In ACM Workshop on Online Social Networks (WOSN) , 2010 . X. Zhao, A. Sala, C. Wilson, H. Zheng, and B. Y. Zhao. Orion: Shortest path estimation for large social graphs. In ACM Workshop on Online Social Networks (WOSN), 2010."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.4108\/icst.collaboratecom.2011.247162"}],"event":{"name":"SIGCOMM '12: ACM SIGCOMM 2012 Conference","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"],"location":"Helsinki Finland","acronym":"SIGCOMM '12"},"container-title":["Proceedings of the 2012 ACM workshop on Workshop on online social networks"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2342549.2342559","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2342549.2342559","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:34:06Z","timestamp":1750239246000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2342549.2342559"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,17]]},"references-count":20,"alternative-id":["10.1145\/2342549.2342559","10.1145\/2342549"],"URL":"https:\/\/doi.org\/10.1145\/2342549.2342559","relation":{},"subject":[],"published":{"date-parts":[[2012,8,17]]},"assertion":[{"value":"2012-08-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}