{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:41:27Z","timestamp":1750308087178,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,6,6]],"date-time":"2005-06-06T00:00:00Z","timestamp":1118016000000},"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":[[2005,6,6]]},"DOI":"10.1145\/1064092.1064143","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"327-335","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Finding the best shortcut in a geometric network"],"prefix":"10.1145","author":[{"given":"Mohammad","family":"Farshi","sequence":"first","affiliation":[{"name":"TU Eindhoven, The Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos","family":"Giannopoulos","sequence":"additional","affiliation":[{"name":"Freie Universit\u00e4t Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Gudmundsson","sequence":"additional","affiliation":[{"name":"NICTA, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,6,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02189308"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2003.1195412"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225191"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365722"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2004.01.003"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/200836.200853"},{"key":"e_1_3_2_1_7_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1007\/3-540-45022-X_72","volume-title":"Proc. 27th International Colloquium on Automata, Languages and Programming","author":"Czumaj A.","year":"2000","unstructured":"A. Czumaj and A. Lingas . Fast approximation schemes for Euclidean multi-connectivity problems . In Proc. 27th International Colloquium on Automata, Languages and Programming , volume 1853 of Lecture Notes in Computer Science , pages 856 -- 868 . Springer-Verlag , 2000 .]] A. Czumaj and A. Lingas. Fast approximation schemes for Euclidean multi-connectivity problems. In Proc. 27th International Colloquium on Automata, Languages and Programming, volume 1853 of Lecture Notes in Computer Science, pages 856--868. Springer-Verlag, 2000.]]"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/160985.160998"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195997000193"},{"key":"e_1_3_2_1_10_1","first-page":"215","volume-title":"Proc. 6th ACM-SIAM Symposium on Discrete Algorithms","author":"Das G.","year":"1995","unstructured":"G. Das , G. Narasimhan , and J. Salowe . A new way to weigh malnourished Euclidean graphs . In Proc. 6th ACM-SIAM Symposium on Discrete Algorithms , pages 215 -- 222 , 1995 .]] G. Das, G. Narasimhan, and J. Salowe. A new way to weigh malnourished Euclidean graphs. In Proc. 6th ACM-SIAM Symposium on Discrete Algorithms, pages 215--222, 1995.]]"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/647911.740498"},{"key":"e_1_3_2_1_12_1","first-page":"425","volume-title":"J.-R","author":"Eppstein D.","year":"2000","unstructured":"D. Eppstein . Spanning trees and spanners . In J.-R . Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 425 -- 461 . Elsevier Science Publishers , Amsterdam, 2000 .]] D. Eppstein. Spanning trees and spanners. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 425--461. Elsevier Science Publishers, Amsterdam, 2000.]]"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064092.1064142"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(03)00259-2"},{"key":"e_1_3_2_1_15_1","volume-title":"Manuscript","author":"Gr\u00f6ne A.","year":"2005","unstructured":"A. Gr\u00f6ne . Tightness of upper bound on tB\/tP . Manuscript , March 2005 .]] A. Gr\u00f6ne. Tightness of upper bound on tB\/tP. Manuscript, March 2005.]]"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700382947"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/646345.689916"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_42"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/61764.61787"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/2805869.2805935"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/646516.696169"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758846"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0075-x"},{"key":"e_1_3_2_1_24_1","volume-title":"X.-Z. Cheng, X. Huang, and D.-Z. Du","author":"Li X.-Y.","year":"2003","unstructured":"X.-Y. Li . Applications of computational geomety in wireless ad hoc networks . In X.-Z. Cheng, X. Huang, and D.-Z. Du , editors, Ad Hoc Wireless Networking. Kluwer , 2003 .]] X.-Y. Li. Applications of computational geomety in wireless ad hoc networks. In X.-Z. Cheng, X. Huang, and D.-Z. Du, editors, Ad Hoc Wireless Networking. Kluwer, 2003.]]"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/586846.586967"},{"key":"e_1_3_2_1_26_1","first-page":"69","volume-title":"Proc. 5th SIAM Workshop on Algorithm Engineering and Experiments","author":"Navarro G.","year":"2003","unstructured":"G. Navarro and R. Paredes . Practical construction of metric t-spanners . In Proc. 5th SIAM Workshop on Algorithm Engineering and Experiments , pages 69 -- 81 , 2003 .]] G. Navarro and R. Paredes. Practical construction of metric t-spanners. In Proc. 5th SIAM Workshop on Algorithm Engineering and Experiments, pages 69--81, 2003.]]"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/646491.694952"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276868"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195991000098"},{"key":"e_1_3_2_1_30_1","first-page":"877","volume-title":"J.-R","author":"Smid M.","year":"2000","unstructured":"M. Smid . Closest point problems in computational geometry . In J.-R . Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 877 -- 935 . Elsevier Science Publishers , Amsterdam, 2000 .]] M. Smid. Closest point problems in computational geometry. In J.-R. Sack and J. Urrutia, editors, Handbook of Computational Geometry, pages 877--935. Elsevier Science Publishers, Amsterdam, 2000.]]"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574695"}],"event":{"name":"SoCG05: The 21st Annual ACM Symposium on Computational Geometry 2005","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Pisa Italy","acronym":"SoCG05"},"container-title":["Proceedings of the twenty-first annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1064092.1064143","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1064092.1064143","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:07:50Z","timestamp":1750262870000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1064092.1064143"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6,6]]},"references-count":31,"alternative-id":["10.1145\/1064092.1064143","10.1145\/1064092"],"URL":"https:\/\/doi.org\/10.1145\/1064092.1064143","relation":{},"subject":[],"published":{"date-parts":[[2005,6,6]]},"assertion":[{"value":"2005-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}