{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:48Z","timestamp":1759637808302},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"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":5921,"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":[[1997,5]]},"DOI":"10.1016\/s0166-218x(96)00045-5","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"203-216","source":"Crossref","is-referenced-by-count":14,"title":["On spanning 2-trees in a graph"],"prefix":"10.1016","volume":"74","author":[{"given":"Leizhen","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00045-5_BIB1","article-title":"Network design problems: Steiner trees and spanning k-trees","author":"Bern","year":"1987"},{"key":"10.1016\/S0166-218X(96)00045-5_BIB2","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0166-218X(96)00045-5_BIB3","doi-asserted-by":"crossref","DOI":"10.1137\/S0895480192237403","article-title":"Tree spanners: spanning trees that approximate distances","author":"Cai","year":"1992"},{"issue":"3","key":"10.1016\/S0166-218X(96)00045-5_BIB4","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(96)00045-5_BIB5","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0166-218X(93)90228-G","article-title":"On the spanning k-tree problem","volume":"44","author":"Cai","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(96)00045-5_BIB6","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01758755","article-title":"A proof of the Gilbert-Pollak conjecture on the Steiner ratio","volume":"7","author":"Du","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/S0166-218X(96)00045-5_BIB7","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1002\/net.3230110304","article-title":"Networks immune to isolated failures","volume":"11","author":"Farley","year":"1981","journal-title":"Networks"},{"issue":"2","key":"10.1016\/S0166-218X(96)00045-5_BIB8","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF02579168","article-title":"Efficient algorithms for finding minimum spanning trees in undirected and directed graphs","volume":"6","author":"Gabow","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/S0166-218X(96)00045-5_BIB9","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(96)00045-5_BIB10","series-title":"Data Structures and Network Algorithms","author":"Tarjan","year":"1983"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000455?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000455?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:26:27Z","timestamp":1556666787000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X96000455"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,5]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,5]]}},"alternative-id":["S0166218X96000455"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00045-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,5]]}}}