{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:00Z","timestamp":1725558900650},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540243021"},{"type":"electronic","value":"9783540305774"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30577-4_36","type":"book-chapter","created":{"date-parts":[[2010,7,4]],"date-time":"2010-07-04T19:48:39Z","timestamp":1278272919000},"page":"330-339","source":"Crossref","is-referenced-by-count":1,"title":["Cost-Constrained Minimum-Delay Multicasting"],"prefix":"10.1007","author":[{"given":"Satoshi","family":"Tayu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Turki Ghazi","family":"Al-Mutairi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuichi","family":"Ueno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","unstructured":"Chan, G., Xue, G.: k-pair delay constrained minimum cost routing in undirected networks. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 230\u2013231 (2001)"},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1109\/90.234851","volume":"1","author":"V. Kompella","year":"1993","unstructured":"Kompella, V., Pasquale, J., Polyzos, G.: Multicast routing for multimedia communication. IEEE\/ACM Transactions on Networking\u00a01, 286\u2013292 (1993)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"36_CR3","first-page":"213","volume":"6","author":"M. Parsa","year":"2001","unstructured":"Parsa, M., Zhu, Q., Garcia-Luna-Aceves, J.J.: An iterative algorithm for delay-constrained minimum-cost multicast. IEEE\/ACM Trans. Networking\u00a06, 213\u2013219 (2001)","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"36_CR4","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.1016\/S0140-3664(98)00208-4","volume":"21","author":"R. Sriram","year":"1998","unstructured":"Sriram, R., Manimaran, G., Murthy, C.: Algorithms for delay-constrained low-cost multicast tree construction. Computer Communications\u00a021, 1693\u20131706 (1998)","journal-title":"Computer Communications"},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1016\/S0140-3664(02)00029-4","volume":"25","author":"H. Youssef","year":"2002","unstructured":"Youssef, H., AI-Mulhem, A., Sait, S., Tahir, M.: QoS-driven multicast tree generation using tabu search. Computer Communications\u00a025, 1140\u20131149 (2002)","journal-title":"Computer Communications"},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R. Hassin","year":"1992","unstructured":"Hassin, R.: Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research\u00a017, 36\u201342 (1992)","journal-title":"Mathematics of Operations Research"},{"key":"36_CR7","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0304-3975(03)00088-4","volume":"304","author":"G. Chen","year":"2003","unstructured":"Chen, G., Xue, G.: A PTAS for weight constrained steiner trees in series-parallel graphs. Theoretical Computer Science\u00a0304, 237\u2013247 (2003)","journal-title":"Theoretical Computer Science"},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1002\/net.3230130202","volume":"13","author":"J. Wald","year":"1983","unstructured":"Wald, J., Colbourn, C.: Steiner trees, partial 2-trees and minimum IFI networks. Networks\u00a013, 159\u2013167 (1983)","journal-title":"Networks"},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0167-6377(01)00069-4","volume":"28","author":"D. Lorenz","year":"2001","unstructured":"Lorenz, D., Raz, D.: A simple efficient approximation scheme for the restricted path problem. Operations Research Letters\u00a028, 213\u2013219 (2001)","journal-title":"Operations Research Letters"},{"key":"36_CR10","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1287\/opre.35.1.70","volume":"35","author":"A. Warburton","year":"1987","unstructured":"Warburton, A.: Approximation of pareto optima in multiple-objective shortest path problems. Operations Research\u00a035, 70\u201379 (1987)","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2005: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30577-4_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:31:06Z","timestamp":1620012666000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30577-4_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540243021","9783540305774"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30577-4_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}