{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:54Z","timestamp":1761611214203},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725039"},{"type":"electronic","value":"9783540725046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72504-6_31","type":"book-chapter","created":{"date-parts":[[2007,7,22]],"date-time":"2007-07-22T11:36:39Z","timestamp":1185104199000},"page":"342-353","source":"Crossref","is-referenced-by-count":3,"title":["Approximating Capacitated Tree-Routings in Networks"],"prefix":"10.1007","author":[{"given":"Ehab","family":"Morsy","sequence":"first","affiliation":[]},{"given":"Hiroshi","family":"Nagamochi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/11533719_16","volume-title":"Computing and Combinatorics","author":"Z. Cai","year":"2005","unstructured":"Cai, Z., Lin, G.-H., Xue, G.: Improved approximation algorithms for the capacitated multicast routing problem. In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 136\u2013145. Springer, Heidelberg (2005)"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s00453-003-1069-7","volume":"38","author":"R. Hassin","year":"2004","unstructured":"Hassin, R., Ravi, R., Salman, F.S.: Approximation algorithms for a capacitated network design problem. Algorithmica\u00a038, 417\u2013431 (2004)","journal-title":"Algorithmica"},{"key":"31_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1007\/978-3-540-27836-8_68","volume-title":"Automata, Languages and Programming","author":"R. Jothi","year":"2004","unstructured":"Jothi, R., Raghavachari, B.: Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design. In: D\u00edaz, J., et al. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 805\u2013818. Springer, Heidelberg (2004)"},{"key":"31_CR4","unstructured":"Mansour, Y., Peleg, D.: An approximation algorithm for minimum-cost network design. Tech. Report Cs94-22, The Weizman Institute of Science, Rehovot (1994), also presented at the DIMACS Workshop on Robust Communication Network (1998)"},{"key":"31_CR5","unstructured":"Morsy, E., Nagamochi, H.: An improved approximation algorithm for capacitated multicast routings in networks. In: Proceedings of International Symposium on Scheduling 2006, Tokyo, Japan, pp. 12\u201317 (2006)"},{"key":"31_CR6","unstructured":"Robins, G., Zelikovsky, A.Z.: Improved Steiner tree approximation in graphs. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms-SODA\u20192000, pp. 770\u2013779 (2000)"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1137\/S1052623497321432","volume":"11","author":"F.S. Salman","year":"2000","unstructured":"Salman, F.S., et al.: Approximating the single-sink link-installation problem in network design. SIAM J. Optim.\u00a011, 595\u2013610 (2000)","journal-title":"SIAM J. Optim."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72504-6_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:38:11Z","timestamp":1619516291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72504-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540725039","9783540725046"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72504-6_31","relation":{},"subject":[]}}