{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:27:08Z","timestamp":1761611228807},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540697329"},{"type":"electronic","value":"9783540697336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69733-6_61","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"621-630","source":"Crossref","is-referenced-by-count":1,"title":["Approximating the Generalized Capacitated Tree-Routing Problem"],"prefix":"10.1007","author":[{"given":"Ehab","family":"Morsy","sequence":"first","affiliation":[]},{"given":"Hiroshi","family":"Nagamochi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"61_CR1","unstructured":"Behjat, L.: New Modeling and Optimization Techniques for the Global Routing Problem. Ph.D. Thesis, University of Waterloo (2002)"},{"issue":"2","key":"61_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1287\/ijoc.1040.0127","volume":"18","author":"L. Behjat","year":"2002","unstructured":"Behjat, L., Vannelli, A., Rosehart, W.: Integer Linear Programming Models for Global Routing. Informs Journal on Computing\u00a018(2), 137\u2013150 (2002)","journal-title":"Informs Journal on Computing"},{"key":"61_CR3","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1006\/jagm.1994.1041","volume":"17","author":"P. Berman","year":"1994","unstructured":"Berman, P., Ramaiyer, V.: Improved Approximations for the Steiner Tree Problem. J. Algorithms\u00a017, 381\u2013408 (1994)","journal-title":"J. Algorithms"},{"key":"61_CR4","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":"61_CR5","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"M.R. Garey","year":"1977","unstructured":"Garey, M.R., Johnson, D.S.: The Rectilinear Steiner Tree Problem is NP-Complete. SIAM J. Appl. Math.\u00a032, 826\u2013843 (1977)","journal-title":"SIAM J. Appl. Math."},{"key":"61_CR6","volume-title":"Computers and Intractability, a Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, a Guide to the Theory of NP-completeness. Freeman, San Francisco (1978)"},{"key":"61_CR7","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":"61_CR8","unstructured":"Hougardy, S., Pr\u00f6mmel, H.J.: A 1.598-Approximation Algorithm for the Steiner Problem in Graphs. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1999), pp. 448\u2013453 (1999)"},{"key":"61_CR9","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., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 805\u2013818. Springer, Heidelberg (2004)"},{"key":"61_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1023\/A:1009758919736","volume":"1","author":"M. Karpinsky","year":"1997","unstructured":"Karpinsky, M., Zelikovsky, A.: New Approximation Algorithms for the Steiner Tree Problem. J. Combin. Optim.\u00a01, 47\u201365 (1997)","journal-title":"J. Combin. Optim."},{"key":"61_CR11","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.tcs.2007.10.021","volume":"390","author":"E. Morsy","year":"2008","unstructured":"Morsy, E., Nagamochi, H.: An Improved Approximation Algorithm for Capacitated Multicast Routings in Networks. Theoritical Computer Sceince\u00a0390, 81\u201391 (2008)","journal-title":"Theoritical Computer Sceince"},{"key":"61_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-540-72504-6_31","volume-title":"Theory and Applications of Models of Computation","author":"E. Morsy","year":"2007","unstructured":"Morsy, E., Nagamochi, H.: Approximating Capacitated Tree-Routings in Networks. In: Cai, J.-Y., Cooper, S.B., Zhu, H. (eds.) TAMC 2007. LNCS, vol.\u00a04484, pp. 342\u2013353. Springer, Heidelberg (2007)"},{"key":"61_CR13","unstructured":"Morsy, E., Nagamochi, H.: Approximating the Generalized Capacitated Tree-Routing Problem. Technical Report, 2008-001, Discrete Mathematics Lab., Graduate School of Informatics, Kyoto University, http:\/\/www.amp.i.kyoto-u.ac.jp\/tecrep\/TR2008.html"},{"key":"61_CR14","doi-asserted-by":"crossref","unstructured":"Pr\u00f6mmel, H.J., Steger, A.: RNC-Approximation Algorithms for the Steiner Problem. In: Proceedings of the 14th Annual Symposium on Theoritical Aspects of Computer Science, pp. 559\u2013570 (1997)","DOI":"10.1007\/BFb0023489"},{"key":"61_CR15","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 2000), pp. 770\u2013779 (2000)"},{"key":"61_CR16","first-page":"573","volume":"24","author":"H. Takahashi","year":"1980","unstructured":"Takahashi, H., Matsuyama, A.: An Approximate Solution for the Steiner Problem in Graphs. Math. Japon.\u00a024, 573\u2013577 (1980)","journal-title":"Math. Japon."},{"key":"61_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1051","DOI":"10.1007\/11602613_104","volume-title":"Algorithms and Computation","author":"T. Terlaky","year":"2005","unstructured":"Terlaky, T., Vannelli, A., Zhang, H.: On Routing in VLSI Design and Communication Networks. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 1051\u20131060. Springer, Heidelberg (2005)"},{"key":"61_CR18","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF01187035","volume":"9","author":"A. Zelikovsky","year":"1993","unstructured":"Zelikovsky, A.: An 11\/6-approximation Algorithm for the Network Steiner Problem. Algorithmica\u00a09, 463\u2013470 (1993)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69733-6_61.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:02:23Z","timestamp":1605762143000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69733-6_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540697329","9783540697336"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69733-6_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}