{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:02Z","timestamp":1759638242572,"version":"3.40.5"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319156118"},{"type":"electronic","value":"9783319156125"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-15612-5_13","type":"book-chapter","created":{"date-parts":[[2015,2,23]],"date-time":"2015-02-23T04:05:18Z","timestamp":1424664318000},"page":"137-148","source":"Crossref","is-referenced-by-count":3,"title":["PTAS\u2019s for Some Metric p-source Communication Spanning Tree Problems"],"prefix":"10.1007","author":[{"given":"Santiago V.","family":"Ravelo","sequence":"first","affiliation":[]},{"given":"Carlos E.","family":"Ferreira","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Bartal, Y.: Probabilistic approximation of metric spaces and its algorithmic applications. In: Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, pp. 184\u20131963 (1996)","DOI":"10.1109\/SFCS.1996.548477"},{"issue":"3","key":"13_CR2","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/0203015","volume":"3","author":"T.C. Hu","year":"1974","unstructured":"Hu, T.C.: Optimum communication spanning trees. SIAM J. Comput.\u00a03(3), 188\u2013195 (1974)","journal-title":"SIAM J. Comput."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1002\/net.3230080402","volume":"8","author":"D.S. Johnson","year":"1978","unstructured":"Johnson, D.S., Lenstra, J.K., Kan, A.H.G.R.: The complexity of the network design problem. Networks\u00a08, 279\u2013285 (1978)","journal-title":"Networks"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Talwar, K., Fakcharoenphol, J., Rao, S.: A tight bound on approximating arbitrary metrics by tree metrics. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pp. 448\u2013455 (2003)","DOI":"10.1145\/780606.780608"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/S0196-6774(02)00205-5","volume":"44","author":"B.Y. Wu","year":"2002","unstructured":"Wu, B.Y.: A polynomial time approximation scheme for the two-source minimum routing cost spanning trees. J. Algorithms\u00a044, 359\u2013378 (2002)","journal-title":"J. Algorithms"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.dam.2003.10.002","volume":"143","author":"B.Y. Wu","year":"2004","unstructured":"Wu, B.Y.: Approximation algorithms for the optimal p-source communication spanning tree. Discrete and Applied Mathematics\u00a0143, 31\u201342 (2004)","journal-title":"Discrete and Applied Mathematics"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Wu, B.Y., Chao, K.M.: Spanning Trees and Optimization Problems. Chapman & Hall \/ CRC (2004) ISBN: 1584884363","DOI":"10.1201\/9780203497289"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0166-218X(99)00212-7","volume":"102","author":"B.Y. Wu","year":"2000","unstructured":"Wu, B.Y., Chao, K.M., Tang, C.Y.: Approximation algorithms for some optimum communication spanning tree problems. Discrete and Applied Mathematics\u00a0102, 245\u2013266 (2000)","journal-title":"Discrete and Applied Mathematics"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1006\/jagm.2000.1088","volume":"36","author":"B.Y. Wu","year":"2000","unstructured":"Wu, B.Y., Chao, K.M., Tang, C.Y.: A polynomial time approximation scheme for optimal product-requirement communication spanning trees. J. Algorithms\u00a036, 182\u2013204 (2000)","journal-title":"J. Algorithms"},{"issue":"3","key":"13_CR10","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1137\/S009753979732253X","volume":"29","author":"B.Y. Wu","year":"2000","unstructured":"Wu, B.Y., Lancia, G., Bafna, V., Chao, K.M., Ravi, R., Tang, C.Y.: A polynomial time approximation scheme for minimum routing cost spanning trees. SIAM J. on Computing\u00a029(3), 761\u2013778 (2000)","journal-title":"SIAM J. on Computing"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15612-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T21:48:36Z","timestamp":1747691316000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-15612-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319156118","9783319156125"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15612-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}