{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T04:10:30Z","timestamp":1743653430631,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642315930"},{"type":"electronic","value":"9783642315947"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31594-7_16","type":"book-chapter","created":{"date-parts":[[2012,6,22]],"date-time":"2012-06-22T21:20:21Z","timestamp":1340400021000},"page":"182-193","source":"Crossref","is-referenced-by-count":4,"title":["Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree"],"prefix":"10.1007","author":[{"given":"T. -H. Hubert","family":"Chan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingfei","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Ning","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Arya, S., Das, G., Mount, D.M., Salowe, J.S., Smid, M.H.M.: Euclidean spanners: short, thin, and lanky. In: STOC 1995, pp. 489\u2013498 (1995)","DOI":"10.1145\/225058.225191"},{"key":"16_CR2","unstructured":"Callahan, P.B., Kosaraju, S.R.: Faster algorithms for some geometric graph problems in higher dimensions. In: SODA 1993, pp. 291\u2013300 (1993)"},{"key":"16_CR3","unstructured":"Chan, H.T.-H., Gupta, A., Maggs, B.M., Zhou, S.: On hierarchical routing in doubling metrics. In: SODA 2005, pp. 762\u2013771 (2005)"},{"issue":"1","key":"16_CR4","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/s00454-008-9115-5","volume":"41","author":"T.-H.H. Chan","year":"2009","unstructured":"Chan, T.-H.H., Gupta, A.: Small hop-diameter sparse spanners for doubling metrics. Discrete & Computational Geometry\u00a041(1), 28\u201344 (2009)","journal-title":"Discrete & Computational Geometry"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF01840366","volume":"2","author":"B. Chazelle","year":"1987","unstructured":"Chazelle, B.: Computing on a free tree via complexity-preserving mappings. Algorithmica\u00a02, 337\u2013361 (1987)","journal-title":"Algorithmica"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Chechik, S., Langberg, M., Peleg, D., Roditty, L.: Fault-tolerant spanners for general graphs. In: STOC 2009, pp. 435\u2013444 (2009)","DOI":"10.1145\/1536414.1536475"},{"issue":"2","key":"16_CR7","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s00454-004-1121-7","volume":"32","author":"A. Czumaj","year":"2004","unstructured":"Czumaj, A., Zhao, H.: Fault-tolerant geometric spanners. Discrete & Computational Geometry\u00a032(2), 207\u2013230 (2004)","journal-title":"Discrete & Computational Geometry"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Das, G., Narasimhan, G.: A fast algorithm for constructing sparse euclidean spanners. In: Symposium on Computational Geometry, pp. 132\u2013139 (1994)","DOI":"10.1145\/177424.177579"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Dinitz, M., Krauthgamer, R.: Fault-tolerant spanners: better and simpler. In: PODC 2011, pp. 169\u2013178 (2011)","DOI":"10.1145\/1993806.1993830"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/978-3-540-87744-8_40","volume-title":"Algorithms - ESA 2008","author":"L.-A. Gottlieb","year":"2008","unstructured":"Gottlieb, L.-A., Roditty, L.: An Optimal Dynamic Spanner for Doubling Metric Spaces. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol.\u00a05193, pp. 478\u2013489. Springer, Heidelberg (2008)"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Gupta, A., Krauthgamer, R., Lee, J.R.: Bounded geometries, fractals, and low-distortion embeddings. In: FOCS 2003, pp. 534\u2013543 (2003)","DOI":"10.1109\/SFCS.2003.1238226"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Har-Peled, S., Mendel, M.: Fast construction of nets in low dimensional metrics, and their applications. In: Symposium on Computational Geometry, pp. 150\u2013158 (2005)","DOI":"10.1145\/1064092.1064117"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Levcopoulos, C., Narasimhan, G., Smid, M.H.M.: Efficient algorithms for constructing fault-tolerant geometric spanners. In: STOC 1998, pp. 186\u2013195 (1998)","DOI":"10.1145\/276698.276734"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-48447-7_20","volume-title":"Algorithms and Data Structures","author":"T. Lukovszki","year":"1999","unstructured":"Lukovszki, T.: New Results on Fault Tolerant Geometric Spanners. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol.\u00a01663, pp. 193\u2013204. Springer, Heidelberg (1999)"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Narasimhan, G., Smid, M.H.M.: Geometric spanner networks. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511546884"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-15775-2_5","volume-title":"Algorithms \u2013 ESA 2010","author":"S. Solomon","year":"2010","unstructured":"Solomon, S., Elkin, M.: Balancing Degree, Diameter and Weight in Euclidean Spanners. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol.\u00a06346, pp. 48\u201359. Springer, Heidelberg (2010)"},{"issue":"2","key":"16_CR17","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R.E. Tarjan","year":"1975","unstructured":"Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. J. ACM\u00a022(2), 215\u2013225 (1975)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31594-7_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T12:11:48Z","timestamp":1743595908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31594-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642315930","9783642315947"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31594-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}