{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:21:15Z","timestamp":1743024075856,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540646822"},{"type":"electronic","value":"9783540691068"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054367","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T07:43:28Z","timestamp":1149666208000},"page":"193-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Concurrent multicast in weighted networks"],"prefix":"10.1007","author":[{"given":"Gianluca","family":"De Marco","sequence":"first","affiliation":[]},{"given":"Luisa","family":"Gargano","sequence":"additional","affiliation":[]},{"given":"Ugo","family":"Vaccaro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,26]]},"reference":[{"unstructured":"E. Ahaxoni, R. Cohen, \u201cRestricted Dynamic Steiner Trees for Scalable Multicast in Datagram Networks\u201d, Proc. INFOCOM'97, Kobe, Japan, April 1997.","key":"18_CR1"},{"doi-asserted-by":"crossref","unstructured":"B. Awerbuch, A. Barowtz, D. Peleg, \u201cCost-Sensitive Analysis of Communication Protocols\u201d, Proceedings of PODC'90, 177\u2013187.","key":"18_CR2","DOI":"10.1145\/93385.93417"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1137\/S0097539790192672","volume":"23","author":"A. Bagchi","year":"1994","unstructured":"A. Bagchi, E.F. Schmeichel, and S.L. Hakimi, \u201cParallel Information Dissemination by Packets\u201d, SIAM J. on Computing, 23 (1994), 355\u2013372.","journal-title":"SIAM J. on Computing"},{"unstructured":"A. Bar-Noy, S. Guha, J. Naor, and B. Schieber, \u201cMulticasting in Heterogeneous Networks\u201d, Proceedings of STOC '98.","key":"18_CR4"},{"doi-asserted-by":"crossref","unstructured":"F. Bauer, A. Varma, \u201cAries: a Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm, Proc. INFOCOM'96, 361\u2013368.","key":"18_CR5","DOI":"10.1109\/INFCOM.1996.497914"},{"doi-asserted-by":"crossref","unstructured":"P. Berman, C. Coulston, \u201cOn-line algorithms for Steiner Tree Problems\u201d, Proc. STOC'97, 344\u2013353.","key":"18_CR6","DOI":"10.1145\/258533.258618"},{"unstructured":"J.-C. Bermond, L. Gargano, A. Rescigno, and U. Vaccaro, \u201cFast Gossiping by Short Messages\u201d, SIAM J. on Computing, to appear.","key":"18_CR7"},{"unstructured":"J.-C. Bermond, L. Gargano, S. Perennes, \u201cSequential Gossiping by Short Messages\u201d, Discr. Appl. Math., to appear.","key":"18_CR8"},{"key":"18_CR9","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"D. P. Bertsekas","year":"1989","unstructured":"D. P. Bertsekas, and J. N. Tsitsiklis, Parallel and Distributed Computation: Numerical Methods, Prentice-Hall, Englewood Cliffs, NJ, 1989."},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","volume":"53","author":"P. Fraignaud","year":"1994","unstructured":"P. Fraignaud, E. Lazard, \u201cMethods and Problems of Communication in Usual etworks\u201d, Discrete Applied Math., 53 (1994), 79\u2013134.","journal-title":"Discrete Applied Math."},{"unstructured":"L. Gargano and A. A. Rescigno, \u201cCommunication Complexity of Fault-Tolerant information Diffusion\u201d, Theoretical Computer Science, to appear.","key":"18_CR11"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jpdc.1997.1357","volume":"45","author":"L. Gargano","year":"1997","unstructured":"L. Gargano, A. A. Rescigno, and U. Vaccaro, \u201cCommunication Complexity of Gossiping by Short Messages\u201d, Journal of Parallel and Distributed Computing, 45, (1997), pp. 73\u201381. An extended abstract appeared in Proceedings of SWAT'96, Rolf Karlsson and Andrzej Lingas (Eds.), Lectures Notes in Computer Science, vol. 1097, pp. 234\u2013245, Springer-Verlag, 1996.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"18_CR13","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230180406","volume":"18","author":"S. Hedetniemi","year":"1988","unstructured":"S. Hedetniemi, S. Hedetniemi, and A. Liestman, \u201cA Survey of Gossiping and Broadcasting in Communication Networks\u201d, NETWORKS, 18 (1988), 129\u2013134.","journal-title":"NETWORKS"},{"doi-asserted-by":"crossref","unstructured":"J. Hromkovivc, R. Klasing, B. Monien, and R. Peine, \u201cDissemination of Information in Interconnection Networks (Broadcasting and Gossiping)\u201d, in: Ding-Zhu Du and D. Frank Hsu (Eds.) Combinatorial Network Theory, Kluwer Academic Publishers, 1995, pp. 125\u2013212.","key":"18_CR14","DOI":"10.1007\/978-1-4757-2491-2_5"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1023\/A:1009758919736","volume":"1","author":"M. Karpinski","year":"1997","unstructured":"M. Karpinski, A. Zelikovsky, \u201cNew Approximation Algorithms for the Steiner Trees Problems\u201d, Journal of Combinatorial Optimization 1 (1997), 47\u201365.","journal-title":"Journal of Combinatorial Optimization"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1137\/0404033","volume":"4","author":"M. Imase","year":"1991","unstructured":"M. Imase, B.M. Waxman, \u201cDynamic Steiner Tree Problem\u201d, SIAM J. Discr. Math, 4 (1991), 369\u2013384.","journal-title":"SIAM J. Discr. Math"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/0166-218X(92)90010-8","volume":"40","author":"H.-M. Lee","year":"1992","unstructured":"H.-M. Lee, G.J. Chang, \u201cSet-to-Set Broadcasting in Communication Networks\u201d, Discr. Appl. Math., 40 (1992), 411\u2013421.","journal-title":"Discr. Appl. Math."},{"key":"18_CR18","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1002\/net.3230230425","volume":"23","author":"Q. Li","year":"1993","unstructured":"Q. Li, Z. Zhang, J. Xu, \u201cA Very Short Proof of a Conjecture Concerning Set-to-Set Broadcasting\u201d, Networks, 23 (1993), 449\u2013450.","journal-title":"Networks"},{"key":"18_CR19","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.3230180205","volume":"18","author":"D. Richards","year":"1988","unstructured":"D. Richards, A. Liestman, \u201cGeneralizations of Broadcasting and Gossiping\u201d, Networks, 18 (1988), 125\u2013138.","journal-title":"Networks"},{"key":"18_CR20","volume-title":"Computer Networks","author":"A. S. Tanenbaum","year":"1981","unstructured":"A. S. Tanenbaum, Computer Networks, Prentice Hall, Englewood Cliffs, N.J., 1981"},{"key":"18_CR21","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/net.3230170203","volume":"17","author":"P. Winter","year":"1987","unstructured":"P. Winter, \u201cSteiner Problems in Networks: a Survey\u201d, Netw., 17 (1987), 129\u2013167.","journal-title":"Netw."},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1137\/0220027","volume":"20","author":"O. Wolfson","year":"1991","unstructured":"O. Wolfson and A. Segall, \u201cThe Communication Complexity of Atomic Commitment and of Gossiping\u201d, SIAM J. on Computing, 20 (1991), 423\u2013450.","journal-title":"SIAM J. on Computing"},{"key":"18_CR23","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF01187035","volume":"9","author":"A. Z. Zelikovsky","year":"1993","unstructured":"A. Z. Zelikovsky, \u201cAn 11\/6-Approximation Algorithm for the Network Steiner Problem\u201d, Algorithmica, 9:463\u2013470, 1993.","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT'98"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054367","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T07:20:42Z","timestamp":1736407242000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0054367"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646822","9783540691068"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/bfb0054367","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"26 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}