{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T14:32:19Z","timestamp":1664548339303},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,10,20]],"date-time":"2011-10-20T00:00:00Z","timestamp":1319068800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2013,1]]},"DOI":"10.1007\/s00453-011-9580-8","type":"journal-article","created":{"date-parts":[[2011,10,19]],"date-time":"2011-10-19T15:24:14Z","timestamp":1319037854000},"page":"146-158","source":"Crossref","is-referenced-by-count":2,"title":["Relaxed Spanners for Directed Disk Graphs"],"prefix":"10.1007","volume":"65","author":[{"given":"D.","family":"Peleg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Roditty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,10,20]]},"reference":[{"issue":"4","key":"9580_CR1","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1002\/rsa.20130","volume":"30","author":"S. Baswana","year":"2007","unstructured":"Baswana, S., Sen, S.: A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs. Random Struct. Algorithms 30(4), 532\u2013563 (2007)","journal-title":"Random Struct. Algorithms"},{"issue":"4","key":"9580_CR2","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1137\/S0895480103431046","volume":"19","author":"B. Bollob\u00e1s","year":"2005","unstructured":"Bollob\u00e1s, B., Coppersmith, D., Elkin, M.: Sparse distance preservers and additive spanners. SIAM J. Discrete Math. 19(4), 1029\u20131055 (2005)","journal-title":"SIAM J. Discrete Math."},{"issue":"5","key":"9580_CR3","doi-asserted-by":"crossref","first-page":"1740","DOI":"10.1137\/S0097539797327908","volume":"29","author":"D. Dor","year":"2000","unstructured":"Dor, D., Halperin, S., Zwick, U.: All-pairs almost shortest paths. SIAM J. Comput. 29(5), 1740\u20131759 (2000)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9580_CR4","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1109\/JSAC.2004.837364","volume":"23","author":"J. Gao","year":"2005","unstructured":"Gao, J., Guibas, L.J., Hershberger, J., Zhang, L., Zhu, A.: Geometric spanners for routing in mobile networks. IEEE J. Sel. Areas Commun. 23(1), 174\u2013185 (2005)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"9580_CR5","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.comgeo.2005.10.001","volume":"35","author":"J. Gao","year":"2006","unstructured":"Gao, J., Guibas, L., Nguyen, A.: Deformable spanners and applications. Comput. Geom. 35, 2\u201319 (2006)","journal-title":"Comput. Geom."},{"key":"9580_CR6","doi-asserted-by":"crossref","first-page":"1148","DOI":"10.1137\/S0097539704446281","volume":"35","author":"S. Har-Peled","year":"2006","unstructured":"Har-Peled, S., Mendel, M.: Fast construction of nets in low-dimensional metrics and their applications. SIAM J. Comput. 35, 1148\u20131184 (2006)","journal-title":"SIAM J. Comput."},{"issue":"10","key":"9580_CR7","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1109\/TPDS.2003.1239871","volume":"14","author":"X.Y. Li","year":"2003","unstructured":"Li, X.Y., Calinescu, G., Wan, P.J., Wang, Y.: Localized Delaunay triangulation with application in ad hoc wireless networks. IEEE Trans. Parallel Distrib. Syst. 14(10), 1035\u20131047 (2003)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"9580_CR8","first-page":"622","volume-title":"Proc. 7th Int. Conf. on Ad-Hoc Networks and Wireless (AdHoc-NOW)","author":"D. Peleg","year":"2008","unstructured":"Peleg, D., Roditty, L.: Localized spanner construction for ad hoc networks with variable transmission range. In: Proc. 7th Int. Conf. on Ad-Hoc Networks and Wireless (AdHoc-NOW), pp. 622\u2013633 (2008)"},{"key":"9580_CR9","first-page":"373","volume-title":"23rd Annual Symposium on Computational Geometry (SoCG)","author":"L. Roditty","year":"2007","unstructured":"Roditty, L.: Fully dynamic geometric spanners. In: 23rd Annual Symposium on Computational Geometry (SoCG), pp. 373\u2013380 (2007)"},{"key":"9580_CR10","first-page":"885","volume-title":"SODA \u201999: Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms","author":"C. Wagner","year":"1999","unstructured":"Wagner, C., Cowen, L.: Compact roundtrip routing for digraphs. In: SODA \u201999: Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, pp. 885\u2013886. Society for Industrial and Applied Mathematics, Philadelphia (1999)"},{"issue":"7","key":"9580_CR11","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1002\/dac.844","volume":"20","author":"Y. Wang","year":"2006","unstructured":"Wang, Y., Li, X.Y.: Efficient Delaunay-based localized routing for wireless sensor networks. Int. J. Commun. Syst. 20(7), 767\u2013789 (2006)","journal-title":"Int. J. Commun. Syst."},{"issue":"4","key":"9580_CR12","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1137\/0211059","volume":"11","author":"A. Yao","year":"1982","unstructured":"Yao, A.: On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comput. 11(4), 721\u2013736 (1982)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9580_CR13","first-page":"1","volume":"4","author":"L. Zwick","year":"2008","unstructured":"Zwick, L., Roditty, U., Thorup, M.: Roundtrip spanners and roundtrip routing in directed graphs. ACM Trans. Algorithms 4(3), 1\u201317 (2008)","journal-title":"ACM Trans. Algorithms"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9580-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-011-9580-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9580-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:08Z","timestamp":1559137508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-011-9580-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,20]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["9580"],"URL":"https:\/\/doi.org\/10.1007\/s00453-011-9580-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,20]]}}}