{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:28:39Z","timestamp":1759667319161},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"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":4794,"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,6]]},"DOI":"10.1016\/s0166-218x(99)00212-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:02:29Z","timestamp":1027634549000},"page":"245-266","source":"Crossref","is-referenced-by-count":40,"title":["Approximation algorithms for some optimum communication spanning tree problems"],"prefix":"10.1016","volume":"102","author":[{"given":"Bang Ye","family":"Wu","sequence":"first","affiliation":[]},{"given":"Kun-Mao","family":"Chao","sequence":"additional","affiliation":[]},{"given":"Chuan Yi","family":"Tang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00212-7_BIB1","unstructured":"T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1994."},{"key":"10.1016\/S0166-218X(99)00212-7_BIB2","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, San Francisco, 1979."},{"issue":"3","key":"10.1016\/S0166-218X(99)00212-7_BIB3","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(99)00212-7_BIB4","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(99)00212-7_BIB5","doi-asserted-by":"crossref","unstructured":"R.E. Tarjan, Data Structures and Network Algorithms, SIAM Press, Philadelphia, PA, 1983.","DOI":"10.1137\/1.9781611970265"},{"key":"10.1016\/S0166-218X(99)00212-7_BIB6","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(99)00212-7_BIB7","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, SIAM J. Comput. in press. (A preliminary version of this paper appears in the Proceedings of the 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:S0166218X99002127?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99002127?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T23:56:20Z","timestamp":1555286180000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99002127"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0166218X99002127"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00212-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}