{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T11:53:16Z","timestamp":1648554796334},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4549,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,2]]},"DOI":"10.1016\/s0166-218x(00)00223-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:17:26Z","timestamp":1027621046000},"page":"105-127","source":"Crossref","is-referenced-by-count":2,"title":["Independent tree spanners: fault-tolerant spanning trees with constant distance guarantees"],"prefix":"10.1016","volume":"108","author":[{"given":"Dagmar","family":"Handke","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00223-7_BIB1","unstructured":"F.S. Annexstein, K.A. Berman, R.P. Swaminathan, Independent spanning trees with small stretch factors. Technical Report 96\u201313, DIMACS, June 1996."},{"key":"10.1016\/S0166-218X(00)00223-7_BIB2","unstructured":"F.S. Annexstein, K.A. Berman, R.P. Swaminathan, On computing nearly optimal multi-tree paths and s,t-numberings, in: D. Krizanc, P. Widmayer (Eds.), Proceedings of the Fourth International Colloquium on Structural Information and Communication Complexity, SIROCCO\u201997, Carleton Scientific, Waterloo, Ontario, Canada, 1998, pp. 12\u201323."},{"key":"10.1016\/S0166-218X(00)00223-7_BIB3","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0012-365X(89)90079-4","article-title":"Trigraphs","volume":"75","author":"Bondy","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(00)00223-7_BIB4","unstructured":"L. Cai, Tree Spanners: Spanning Trees that Approximate Distances, Ph.D. Thesis, Department of Computer Science, University of Toronto, Canada, 1992."},{"issue":"3","key":"10.1016\/S0166-218X(00)00223-7_BIB5","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S0895480192237403","article-title":"Tree spanners","volume":"8","author":"Cai","year":"1995","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(00)00223-7_BIB6","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(00)00223-7_BIB7","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01202468","article-title":"Independent tree in graphs","volume":"10","author":"Huck","year":"1994","journal-title":"Graphs Combin."},{"issue":"1","key":"10.1016\/S0166-218X(00)00223-7_BIB8","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0890-5401(88)90016-8","article-title":"The multi-tree approach to reliability in distributed networks","volume":"79","author":"Itai","year":"1988","journal-title":"Inform. and Computat."},{"key":"10.1016\/S0166-218X(00)00223-7_BIB9","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0020-0190(92)90230-S","article-title":"On independent spanning trees","volume":"42","author":"Khuller","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(00)00223-7_BIB10","doi-asserted-by":"crossref","unstructured":"C. Levcopoulos, G. Narasimhan, M. Smid, Efficient algorithms for constructing fault-tolerant geometric spanners, in: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, STOC\u201998, ACM Press, New York, 1998, pp. 186\u2013195.","DOI":"10.1145\/276698.276734"},{"key":"10.1016\/S0166-218X(00)00223-7_BIB11","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1002\/jgt.3190130114","article-title":"Graph spanners","volume":"13","author":"Peleg","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(00)00223-7_BIB12","doi-asserted-by":"crossref","unstructured":"D. Peleg, J.D. Ullman, An optimal synchronizer for the hypercube, in: Proceedings 1987 Sixth ACM Symposium on Principles of Distance in Computer, Vancouver, 1987, pp. 77\u201385.","DOI":"10.1145\/41840.41847"},{"issue":"1","key":"10.1016\/S0166-218X(00)00223-7_BIB13","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1093\/comjnl\/28.1.5","article-title":"Labelling and implicit routing in networks","volume":"28","author":"Santoro","year":"1985","journal-title":"Comput. J."},{"key":"10.1016\/S0166-218X(00)00223-7_BIB14","first-page":"225","article-title":"Graph spanners: a survey","volume":"89","author":"Soares","year":"1992","journal-title":"Congr. Numer."},{"key":"10.1016\/S0166-218X(00)00223-7_BIB15","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1002\/jgt.3190130205","article-title":"Three tree-paths","volume":"13","author":"Zehavi","year":"1989","journal-title":"J. Graph Theory"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002237?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002237?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T00:22:16Z","timestamp":1556065336000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00002237"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,2]]}},"alternative-id":["S0166218X00002237"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00223-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}