{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,23]],"date-time":"2023-11-23T16:39:18Z","timestamp":1700757558499},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2000,10,1]],"date-time":"2000-10-01T00:00:00Z","timestamp":970358400000},"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":4672,"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":[[2000,10]]},"DOI":"10.1016\/s0166-218x(00)00185-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:14:31Z","timestamp":1027606471000},"page":"273-289","source":"Crossref","is-referenced-by-count":26,"title":["Approximation algorithms for the shortest total path length spanning tree problem"],"prefix":"10.1016","volume":"105","author":[{"given":"Bang Ye","family":"Wu","sequence":"first","affiliation":[]},{"given":"Kun\u2013Mao","family":"Chao","sequence":"additional","affiliation":[]},{"given":"Chuan Yi","family":"Tang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00185-2_BIB1","doi-asserted-by":"crossref","unstructured":"V. Bafna, E.L. Lawler, P. Pevzner, Approximation Algorithms for Multiple Sequence Alignment, Proceedings of the 5th Combinatorial Pattern Matching Conference, Lecture Notes in Computer Science, Vol. 807, Springer, Berlin, 1994, pp. 43\u201353.","DOI":"10.1007\/3-540-58094-8_4"},{"key":"10.1016\/S0166-218X(00)00185-2_BIB2","series-title":"Introduction to Algorithms","author":"Cormen","year":"1994"},{"issue":"1","key":"10.1016\/S0166-218X(00)00185-2_BIB3","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/net.3230090104","article-title":"Exact and approximate algorithms for optimal network design","volume":"9","author":"Dionne","year":"1979","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(00)00185-2_BIB4","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF01188585","article-title":"A robust model for finding optimal evolutionary trees","volume":"13","author":"Farach","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S0166-218X(00)00185-2_BIB5","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(00)00185-2_BIB6","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF02460299","article-title":"Efficient methods for multiple sequence alignment with guaranteed error bounds","volume":"55","author":"Gusfield","year":"1993","journal-title":"Bull. Math. Biol."},{"key":"10.1016\/S0166-218X(00)00185-2_BIB7","series-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"Gusfield","year":"1997"},{"issue":"3","key":"10.1016\/S0166-218X(00)00185-2_BIB8","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1137\/0203015","article-title":"Optimum communication spanning trees","volume":"3","author":"Hu","year":"1974","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(00)00185-2_BIB9","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1002\/net.3230080402","article-title":"The complexity of the network design problem","volume":"8","author":"Johnson","year":"1978","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(00)00185-2_BIB10","doi-asserted-by":"crossref","first-page":"1763","DOI":"10.1137\/0152101","article-title":"Multiple alignment, communication cost, and graph matching","volume":"52","author":"Pevzner","year":"1992","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0166-218X(00)00185-2_BIB11","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1137\/0601008","article-title":"Worst-case analysis of network design problem heuristics","volume":"1","author":"Wong","year":"1980","journal-title":"SIAM J. Algebraic Discrete Math."},{"key":"10.1016\/S0166-218X(00)00185-2_BIB12","unstructured":"B.Y. Wu, G. Lancia, V. Bafna, K.M. Chao, R. Ravi, C.Y. Tang, A polynomial time approximation scheme for minimum routing cost spanning trees, Proceedings of Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201998), 1998, pp. 21\u201332."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00001852?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00001852?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T14:27:44Z","timestamp":1556461664000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00001852"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,10]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2000,10]]}},"alternative-id":["S0166218X00001852"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00185-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,10]]}}}