{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T22:10:05Z","timestamp":1747519805525,"version":"3.40.5"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319149738"},{"type":"electronic","value":"9783319149745"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-14974-5_2","type":"book-chapter","created":{"date-parts":[[2015,1,28]],"date-time":"2015-01-28T01:23:50Z","timestamp":1422408230000},"page":"9-20","source":"Crossref","is-referenced-by-count":1,"title":["A PTAS for the Metric Case of the Minimum Sum-Requirement Communication Spanning Tree Problem"],"prefix":"10.1007","author":[{"given":"Santiago V.","family":"Ravelo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos E.","family":"Ferreira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"2_CR1","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":"2_CR2","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":"2_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., Rinnooy Kan, A.H.G.: The complexity of the network design problem. Networks\u00a08, 279\u2013285 (1978)","journal-title":"Networks"},{"issue":"3","key":"2_CR4","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"},{"key":"2_CR5","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"},{"key":"2_CR6","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\/780542.780608"},{"key":"2_CR7","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":"2_CR8","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":"1","key":"2_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1142\/S0219265900000056","volume":"1","author":"A.M. Farley","year":"2000","unstructured":"Farley, A.M., Fragopoulou, P., Krumme, D., Proskurowski, A., Richards, D.: Multi-source spanning tree problems. Journal of Interconnection Networks\u00a01(1), 61\u201371 (2000)","journal-title":"Journal of Interconnection Networks"},{"key":"2_CR10","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"},{"issue":"2","key":"2_CR11","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1287\/opre.41.2.338","volume":"41","author":"B.J. Orlin","year":"1993","unstructured":"Orlin, B.J.: A faster strongly polynomial minimum cost flow algorithm. Operations Research\u00a041(2), 338\u2013350 (1993)","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14974-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,17]],"date-time":"2025-05-17T21:40:26Z","timestamp":1747518026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14974-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319149738","9783319149745"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14974-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}