{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:39:37Z","timestamp":1725496777459},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540653851"},{"type":"electronic","value":"9783540493815"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49381-6_43","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T01:47:50Z","timestamp":1196646470000},"page":"408-416","source":"Crossref","is-referenced-by-count":1,"title":["Approximation Algorithms for Some Optimum Communication Spanning Tree Problems"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2001,3,29]]},"reference":[{"key":"43_CR1","unstructured":"T.H. Coremen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithm, the MIT Press, 1994."},{"key":"43_CR2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company, San Fransisco, 1979."},{"issue":"3","key":"43_CR3","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/0203015","volume":"3","author":"T. C. Hu","year":"1974","unstructured":"T. C. Hu, Optimum communication spanning tree, SIAM J. Computing, 3(3):188\u2013195, 1974.","journal-title":"SIAM J. Computing"},{"key":"43_CR4","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1002\/net.3230080402","volume":"8","author":"D.S. Johnson","year":"1978","unstructured":"D.S. Johnson, J.K. Lenstra, and A.H.G. Rinnooy Kan, The Complexity of the network Design problem, Networks, 8:279\u2013285, 1978.","journal-title":"Networks"},{"key":"43_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1137\/0601008","volume":"1","author":"R. Wong","year":"1980","unstructured":"R. Wong, Worst-case analysis of network design problem heuristics. SIAM J. Algebraic Discrete Mathematics, 1:51\u201363, 1980.","journal-title":"SIAM J. Algebraic Discrete Mathematics"},{"key":"43_CR6","unstructured":"B. Y. Wu, G. Lancia, V. Bafna, K. M. Chao, R. Ravi, and C. Y. Tang, A polynomial time approximation scheme for minimum routing cost spanning trees, Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201998), pp. 21\u201332, 1998."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49381-6_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,26]],"date-time":"2019-02-26T00:36:57Z","timestamp":1551141417000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49381-6_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540653851","9783540493815"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-49381-6_43","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}