{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:04:56Z","timestamp":1750694696545,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,7,25]],"date-time":"2010-07-25T00:00:00Z","timestamp":1280016000000},"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":[[2010,7,25]]},"DOI":"10.1145\/1835698.1835743","type":"proceedings-article","created":{"date-parts":[[2010,7,27]],"date-time":"2010-07-27T14:10:11Z","timestamp":1280239811000},"page":"192-200","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Forbidden-set distance labels for graphs of bounded doubling dimension"],"prefix":"10.1145","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[{"name":"Microsoft Research, Mountain View, CA, USA"}]},{"given":"Shiri","family":"Chechik","sequence":"additional","affiliation":[{"name":"Weizmann Institute - Israel, Rehovot, Israel"}]},{"given":"Cyril","family":"Gavoille","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Bordeaux, Bordeaux, France"}]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[{"name":"Weizmann Institute - Israel, Rehovot, Israel"}]}],"member":"320","published-online":{"date-parts":[[2010,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146411"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2006.72"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536431"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2008.06.030"},{"key":"e_1_3_2_1_5_1","volume-title":"f-sensitivity distance oracles and routing schemes. Unpublished manuscript","author":"Chechik Shiri","year":"2009","unstructured":"Shiri Chechik , Michael Langberg , David Peleg , and Liam Roditty . f-sensitivity distance oracles and routing schemes. Unpublished manuscript , 2009 . Shiri Chechik, Michael Langberg, David Peleg, and Liam Roditty. f-sensitivity distance oracles and routing schemes. Unpublished manuscript, 2009."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1763424.1763430"},{"key":"e_1_3_2_1_7_1","first-page":"187","article-title":"Compact routing. In Algorithms for Sensor and Ad Hoc Networks","volume":"4621","author":"Dom Michael","year":"2007","unstructured":"Michael Dom . Compact routing. In Algorithms for Sensor and Ad Hoc Networks , LNCS 4621 , 187 -- 202 . SV, 2007 . Michael Dom. Compact routing. In Algorithms for Sensor and Ad Hoc Networks, LNCS 4621,187--202. SV, 2007.","journal-title":"LNCS"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496826"},{"key":"e_1_3_2_1_9_1","volume-title":"13th Symp. on Discrete Algorithms (SODA), 838--843","author":"Demetrescu Camil","year":"2002","unstructured":"Camil Demetrescu and Mikkel Thorup . Oracles for distances avoiding a link-failure . In 13th Symp. on Discrete Algorithms (SODA), 838--843 . ACM-SIAM, 2002 . Camil Demetrescu and Mikkel Thorup. Oracles for distances avoiding a link-failure. In 13th Symp. on Discrete Algorithms (SODA), 838--843. ACM-SIAM, 2002."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.163"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946308"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-002-0073-5"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.05.002"},{"key":"e_1_3_2_1_14_1","volume-title":"26th Symp. on Theoretical Aspects of Computer Science (STACS)","author":"Khanna Neelesh","year":"2010","unstructured":"Neelesh Khanna and Surender Baswana . Approximate shortest path oracle under vertex failure . In 26th Symp. on Theoretical Aspects of Computer Science (STACS) , 2010 . Neelesh Khanna and Surender Baswana. Approximate shortest path oracle under vertex failure. In 26th Symp. on Theoretical Aspects of Computer Science (STACS), 2010."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273445.1273450"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354495"},{"key":"e_1_3_2_1_17_1","volume-title":"18th Symp. on Discrete Algorithms (SODA), 939--948","author":"Konjevod Goran","year":"2007","unstructured":"Goran Konjevod , Andr\u00e9a Werneck Richa , and Donglin Xia . Optimal scale-free compact routing schemes in doubling networks . In 18th Symp. on Discrete Algorithms (SODA), 939--948 . ACM-SIAM, 2007 . Goran Konjevod, Andr\u00e9a Werneck Richa, and Donglin Xia. Optimal scale-free compact routing schemes in doubling networks. In 18th Symp. on Discrete Algorithms (SODA), 939--948. ACM-SIAM, 2007."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87779-0_26"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/647680.732175"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/258492.258523"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.54"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073823"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/3271139.3271275"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007399"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039493"},{"key":"e_1_3_2_1_26_1","unstructured":"David Andrew Twigg. Forbidden-set Routing. PhD thesis University of Cambridge (King's College) 2006.  David Andrew Twigg. Forbidden-set Routing. PhD thesis University of Cambridge (King's College) 2006."}],"event":{"name":"PODC '10: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Zurich Switzerland","acronym":"PODC '10"},"container-title":["Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1835698.1835743","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1835698.1835743","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:08:23Z","timestamp":1750248503000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1835698.1835743"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,25]]},"references-count":26,"alternative-id":["10.1145\/1835698.1835743","10.1145\/1835698"],"URL":"https:\/\/doi.org\/10.1145\/1835698.1835743","relation":{},"subject":[],"published":{"date-parts":[[2010,7,25]]},"assertion":[{"value":"2010-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}