{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:03:26Z","timestamp":1758272606524,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T00:00:00Z","timestamp":1186876800000},"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":[[2007,8,12]]},"DOI":"10.1145\/1281100.1281114","type":"proceedings-article","created":{"date-parts":[[2011,8,3]],"date-time":"2011-08-03T23:36:52Z","timestamp":1312414612000},"page":"81-88","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Compact routing with slack"],"prefix":"10.1145","author":[{"given":"Michael","family":"Dinitz","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}]}],"member":"320","published-online":{"date-parts":[[2007,8,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.51"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132557"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"I.\n      Abraham C.\n      Gavoille and \n      D.\n      Malkhi\n  . \n  Routing with improved communication-space trade-off\n  . In R. Guerraoui editor DISC volume \n  3274\n   of \n  Lecture Notes in Computer Science pages \n  305\n  --\n  319\n  . \n  Springer 2004\n  .  I. Abraham C. Gavoille and D. Malkhi. Routing with improved communication-space trade-off. In R. Guerraoui editor DISC volume 3274 of Lecture Notes in Computer Science pages 305--319. Springer 2004.","DOI":"10.1007\/978-3-540-30186-8_22"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148109.1148143"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148109.1148144"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_20"},{"key":"e_1_3_2_1_7_1","first-page":"660","volume-title":"Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Coppersmith D.","year":"2005","unstructured":"D. Coppersmith and M. Elkin . Sparse source-wise and pair-wise distance preservers . In Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 660 -- 669 , 2005 . D. Coppersmith and M. Elkin. Sparse source-wise and pair-wise distance preservers. In Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 660--669, 2005."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/646254.684110"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/646516.696161"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.70"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011841"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02773799"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/378580.378581"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1044731.1044732"}],"event":{"name":"PODC07: ACM Symposium on Principles of Distributed Computing 2007","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":"Portland Oregon USA","acronym":"PODC07"},"container-title":["Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1281100.1281114","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1281100.1281114","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:52:31Z","timestamp":1750258351000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1281100.1281114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8,12]]},"references-count":14,"alternative-id":["10.1145\/1281100.1281114","10.1145\/1281100"],"URL":"https:\/\/doi.org\/10.1145\/1281100.1281114","relation":{},"subject":[],"published":{"date-parts":[[2007,8,12]]},"assertion":[{"value":"2007-08-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}