{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T15:56:48Z","timestamp":1725638208665},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255908"},{"type":"electronic","value":"9783642255915"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25591-5_22","type":"book-chapter","created":{"date-parts":[[2011,12,3]],"date-time":"2011-12-03T00:32:34Z","timestamp":1322872354000},"page":"200-209","source":"Crossref","is-referenced-by-count":2,"title":["Broadcasting in Heterogeneous Tree Networks with Uncertainty"],"prefix":"10.1007","author":[{"given":"Cheng-Hsiao","family":"Tsou","sequence":"first","affiliation":[]},{"given":"Gen-Huey","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Ching-Chi","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"22_CR1","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0966-8349(98)00033-3","volume":"5","author":"I. Averbakh","year":"1997","unstructured":"Averbakh, I., Berman, O.: Minimax regret p-center location on a network with demand uncertainty. Location Science\u00a05(4), 247\u2013254 (1997)","journal-title":"Location Science"},{"issue":"2","key":"22_CR2","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/S0377-2217(99)00257-X","volume":"123","author":"I. Averbakh","year":"2000","unstructured":"Averbakh, I., Berman, O.: Algorithms for the robust 1-center problem on a tree. European J. Oper. Res.\u00a0123(2), 292\u2013302 (2000)","journal-title":"European J. Oper. Res."},{"issue":"2","key":"22_CR3","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1287\/ijoc.12.2.104.11897","volume":"12","author":"I. Averbakh","year":"2000","unstructured":"Averbakh, I., Berman, O.: Minmax regret median location on a network under uncertainty. INFORMS J. Comput.\u00a012(2), 104\u2013110 (2000)","journal-title":"INFORMS J. Comput."},{"issue":"5","key":"22_CR4","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/BF01184933","volume":"27","author":"A. Bar-Noy","year":"1994","unstructured":"Bar-Noy, A., Kipnis, S.: Designing broadcasting algorithms in the postal model for message-passing systems. Math. Systems Theory\u00a027(5), 431\u2013452 (1994)","journal-title":"Math. Systems Theory"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1023\/A:1020711416254","volume":"110","author":"R.E. Burkard","year":"2002","unstructured":"Burkard, R.E., Dollani, H.: A note on the robust 1-center problem on trees. Ann. Oper. Res.\u00a0110, 69\u201382 (2002)","journal-title":"Ann. Oper. Res."},{"key":"22_CR6","first-page":"99","volume":"10","author":"P. Emde Boas van","year":"1976","unstructured":"van Emde Boas, P., Kaas, R., Zijlstra, E.: Design and implementation of an efficient priority queue. Theory Comput. Syst.\u00a010, 99\u2013127 (1976)","journal-title":"Theory Comput. Syst."},{"key":"22_CR7","first-page":"41","volume-title":"Algorithms and Complexity: New Directions and Recent Results","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S.: Approximation algorithms for combinatorial problems: an annotated bibliography. In: Algorithms and Complexity: New Directions and Recent Results, pp. 41\u201352. Academic Press, New York (1976)"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1287\/trsc.5.2.212","volume":"5","author":"A.J. Goldman","year":"1971","unstructured":"Goldman, A.J.: Optimal center location in simple networks. Transportation Science\u00a05, 212\u2013221 (1971)","journal-title":"Transportation Science"},{"issue":"2","key":"22_CR9","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.jalgor.2005.01.002","volume":"59","author":"S. Khuller","year":"2006","unstructured":"Khuller, S., Kim, Y.A., Wan, Y.C.: On generalized gossiping and broadcasting. J. Algorithms\u00a059(2), 81\u2013106 (2006)","journal-title":"J. Algorithms"},{"issue":"10","key":"22_CR10","doi-asserted-by":"publisher","first-page":"1174","DOI":"10.1109\/12.93751","volume":"40","author":"J.m. Koh","year":"1991","unstructured":"Koh, J.m., Tcha, D.w.: Information dissemination in trees with nonuniform edge transmission times. IEEE Trans. Comput.\u00a040(10), 1174\u20131177 (1991)","journal-title":"IEEE Trans. Comput."},{"key":"22_CR11","first-page":"356","volume-title":"Nonconvex Optimization and its Applications","author":"P. Kouvelis","year":"1997","unstructured":"Kouvelis, P., Yu, G.: Robust discrete optimization and its applications. In: Nonconvex Optimization and its Applications, vol.\u00a014, pp. xvi+356. Kluwer Academic Publishers, Dordrecht (1997)"},{"issue":"3","key":"22_CR12","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/0166-218X(92)90010-8","volume":"40","author":"H.-M. Lee","year":"1992","unstructured":"Lee, H.-M., Chang, G.J.: Set to set broadcasting in communication networks. Discrete Appl. Math.\u00a040(3), 411\u2013421 (1992)","journal-title":"Discrete Appl. Math."},{"key":"22_CR13","unstructured":"Nikulin, Y.: Robustness in combinatorial optimization and scheduling theory: An extended annotated bibliography (August 2006)"},{"issue":"4","key":"22_CR14","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1137\/0210052","volume":"10","author":"P.J. Slater","year":"1981","unstructured":"Slater, P.J., Cockayne, E.J., Hedetniemi, S.T.: Information dissemination in trees. SIAM J. Comput.\u00a010(4), 692\u2013701 (1981)","journal-title":"SIAM J. Comput."},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-642-14031-0_40","volume-title":"Computing and Combinatorics","author":"Y.-H. Su","year":"2010","unstructured":"Su, Y.-H., Lin, C.-C., Lee, D.T.: Broadcasting in Heterogeneous Tree Networks. In: Thai, M.T., Sahni, S. (eds.) COCOON 2010. LNCS, vol.\u00a06196, pp. 368\u2013377. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25591-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T16:09:37Z","timestamp":1548518977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25591-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255908","9783642255915"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25591-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}