{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T22:35:17Z","timestamp":1784673317172,"version":"3.55.0"},"reference-count":21,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2022,7,31]],"date-time":"2022-07-31T00:00:00Z","timestamp":1659225600000},"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":["ACM Trans. Algorithms"],"published-print":{"date-parts":[[2022,7,31]]},"abstract":"<jats:p>\n            Most of the literature on spanners focuses on building the graph from scratch. This article instead focuses on adding edges to improve an existing graph. A major open problem in this field is: Given a graph embedded in a metric space, and a budget of\u00a0\n            <jats:italic>k<\/jats:italic>\n            edges, which\u00a0\n            <jats:italic>k<\/jats:italic>\n            edges do we add to produce a minimum-dilation graph? The special case where\n            <jats:italic>k=1<\/jats:italic>\n            has been studied in the past, but no major breakthroughs have been made for\n            <jats:italic>k &gt; 1<\/jats:italic>\n            . We provide the first positive result, an\n            <jats:italic>O(k)<\/jats:italic>\n            -approximation algorithm that runs in\n            <jats:italic>O(n<\/jats:italic>\n            <jats:sup>3<\/jats:sup>\n            log\n            <jats:italic>n<\/jats:italic>\n            ) time.\n          <\/jats:p>","DOI":"10.1145\/3517807","type":"journal-article","created":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T21:33:50Z","timestamp":1645652030000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Improving the Dilation of a Metric Graph by Adding Edges"],"prefix":"10.1145","volume":"18","author":[{"given":"Joachim","family":"Gudmundsson","sequence":"first","affiliation":[{"name":"University of Sydney, Camperdown NSW, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3803-3804","authenticated-orcid":false,"given":"Sampson","family":"Wong","sequence":"additional","affiliation":[{"name":"University of Sydney, Camperdown NSW, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,10,11]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195910003207"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2007.07.004"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20130"},{"key":"e_1_3_2_5_2","first-page":"762","volume-title":"Proceedings of the 16th Annual Symposium on Discrete Algorithms","author":"Chan Hubert T.-H.","year":"2005","unstructured":"Hubert T.-H. Chan, Anupam Gupta, Bruce M. Maggs, and Shuheng Zhou. 2005. On hierarchical routing in doubling metrics. In Proceedings of the 16th Annual Symposium on Discrete Algorithms. SIAM, 762\u2013771. Retrieved from http:\/\/dl.acm.org\/citation.cfm?id=1070432.1070540"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/b978-044482537-7\/50010-3"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1137\/050635675"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195910003244"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.52"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1201\/9781420010749.ch52"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054109006486"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704446281"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-45738-3_2"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0110-0_17"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2009.03.004"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92182-0_67"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(85)90123-1"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.5555\/1208237"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/b978-044482537-7\/50021-8"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/1044731.1044732"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2009.03.008"}],"container-title":["ACM Transactions on Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3517807","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3517807","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:49:05Z","timestamp":1750182545000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3517807"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,31]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,7,31]]}},"alternative-id":["10.1145\/3517807"],"URL":"https:\/\/doi.org\/10.1145\/3517807","relation":{},"ISSN":["1549-6325","1549-6333"],"issn-type":[{"value":"1549-6325","type":"print"},{"value":"1549-6333","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,31]]},"assertion":[{"value":"2021-01-18","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-02-11","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-10-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}