{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:36:54Z","timestamp":1787506614214,"version":"build-2736575974"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1109\/infcom.2011.5934973","type":"proceedings-article","created":{"date-parts":[[2011,7,7]],"date-time":"2011-07-07T10:59:10Z","timestamp":1310036350000},"page":"1754-1762","source":"Crossref","is-referenced-by-count":16,"title":["Approximate distance queries and compact routing in sparse graphs"],"prefix":"10.1109","author":[{"given":"Rachit","family":"Agarwal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"P. Brighten","family":"Godfrey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sariel","family":"Har-Peled","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.27"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1006\/jpdc.2000.1705","article-title":"Space efficiency for routing schemes of stretch factor three","volume":"61","author":"gavoille","year":"2001","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.76"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354495"},{"key":"ref14","article-title":"Compact routing in power-law graphs","author":"chen","year":"2009","journal-title":"Proc DISC"},{"key":"ref15","article-title":"Approximate distance queries in sparse graphs","author":"agarwal","year":"2010","journal-title":"Tech Rep"},{"key":"ref16","year":"0"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1028788.1028803"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633055"},{"key":"ref4","year":"0"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242685"},{"key":"ref6","article-title":"Compact routing schemes","author":"thorup","year":"2001","journal-title":"Proc ACM SPAA"},{"key":"ref5","article-title":"Distance oracles beyond the Thorup-Zwick bound","author":"p?strcu","year":"2010","journal-title":"Proc IEEE FOCS"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1921168.1921195"},{"key":"ref7","article-title":"S4: Small state and small stretch routing protocol for large wireless sensor networks","author":"mao","year":"2007","journal-title":"Proc USENIX NSDI"},{"key":"ref2","year":"2009","journal-title":"The Cooperative Association for Internet Data Analysis"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1044731.1044732"},{"key":"ref9","article-title":"UIA: A Global Connectivity Architecture for Mobile Personal Devices","author":"ford","year":"2008","journal-title":"PhD thesis"}],"event":{"name":"IEEE INFOCOM 2011 - IEEE Conference on Computer Communications","location":"Shanghai, China","start":{"date-parts":[[2011,4,10]]},"end":{"date-parts":[[2011,4,15]]}},"container-title":["2011 Proceedings IEEE INFOCOM"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5888673\/5934870\/05934973.pdf?arnumber=5934973","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T22:56:23Z","timestamp":1497912983000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5934973\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/infcom.2011.5934973","relation":{},"subject":[],"published":{"date-parts":[[2011,4]]}}}