{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T19:33:51Z","timestamp":1725824031077},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476659"},{"type":"electronic","value":"9783662476666"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-47666-6_51","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T07:46:47Z","timestamp":1434700007000},"page":"638-649","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Distributed Broadcast Revisited: Towards Universal Optimality"],"prefix":"10.1007","author":[{"given":"Mohsen","family":"Ghaffari","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"key":"51_CR1","doi-asserted-by":"crossref","unstructured":"Censor-Hillel, K., Ghaffari, M., Kuhn, F.: Distributed connectivity decomposition. In: The Proc. of the Int\u2019l Symp. on Princ. of Dist. Comp. (PODC), pp. 156\u2013165 (2014)","DOI":"10.1145\/2611462.2611491"},{"key":"51_CR2","doi-asserted-by":"crossref","unstructured":"Censor-Hillel, K., Ghaffari, M., Kuhn, F.: A new perspective on vertex connectivity. In: Pro. of ACM-SIAM Symp. on Disc. Alg. (SODA), pp. 546\u2013561 (2014)","DOI":"10.1137\/1.9781611973402.41"},{"key":"51_CR3","doi-asserted-by":"crossref","unstructured":"Das Sarma, A., Holzer, S., Kor, L., Korman, A., Nanongkai, D., Pandurangan, G., Peleg, D., Wattenhofer, R.: Distributed verification and hardness of distributed approximation. In: Proc. of the Symp. on Theory of Comp. (STOC), pp. 363\u2013372 (2011)","DOI":"10.1145\/1993636.1993686"},{"key":"51_CR4","unstructured":"Elkin, M.: A faster distributed protocol for constructing a minimum spanning tree. In: Pro. of ACM-SIAM Symp. on Disc. Alg. (SODA), pp. 359\u2013368 (2004)"},{"issue":"1","key":"51_CR5","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"RG Gallager","year":"1983","unstructured":"Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimum-weight spanning trees. ACM Trans. on Prog. Lang. and Sys. 5(1), 66\u201377 (1983)","journal-title":"ACM Trans. on Prog. Lang. and Sys."},{"key":"51_CR6","unstructured":"Garay, J., Kutten, S., Peleg, D.: A sub-linear time distributed algorithm for minimum-weight spanning trees. In: Proc. of the Symp. on Found. of Comp. Sci. (FOCS), pp. 659\u2013668 (1993)"},{"key":"51_CR7","doi-asserted-by":"crossref","unstructured":"Kutten, S., Peleg, D.: Fast distributed construction of k-dominating sets and applications. In: The Proc. of the Int\u2019l Symp. on Princ. of Dist. Comp. (PODC), pp. 238\u2013251 (1995)","DOI":"10.1145\/224964.224990"},{"key":"51_CR8","doi-asserted-by":"crossref","unstructured":"Nanongkai, D.: Distributed approximation algorithms for weighted shortest paths. In: Proc. of the Symp. on Theory of Comp. (STOC), pp. 565\u2013573 (2014)","DOI":"10.1145\/2591796.2591850"},{"issue":"1","key":"51_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0012-365X(00)00224-7","volume":"233","author":"J Nesetril","year":"2001","unstructured":"Nesetril, J., Milkova, E., Nesetrilova, H.: Otakar boruvka on minimum spanning tree problem translation of both the 1926 papers, comments, history. Discrete Mathematics 233(1), 3\u201336 (2001)","journal-title":"Discrete Mathematics"},{"key":"51_CR10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing: A Locality-sensitive Approach","author":"D Peleg","year":"2000","unstructured":"Peleg, D.: Distributed Computing: A Locality-sensitive Approach. Society for Industrial and Applied Mathematics, Philadelphia (2000)"},{"key":"51_CR11","unstructured":"Peleg, D., Rubinovich, V.: A near-tight lower bound on the time complexity of distributed MST construction. In: Proc. of the Symp. on Found. of Comp. Sci. (FOCS) (1999)"},{"issue":"2","key":"51_CR12","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1287\/moor.20.2.257","volume":"20","author":"SA Plotkin","year":"1995","unstructured":"Plotkin, S.A., Shmoys, D.B., Tardos, \u00c9.: Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research 20(2), 257\u2013301 (1995)","journal-title":"Mathematics of Operations Research"},{"key":"51_CR13","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1109\/TSE.1985.231858","volume":"10","author":"DM Topkis","year":"1985","unstructured":"Topkis, D.M.: Concurrent broadcast for information dissemination. IEEE Transactions on Software Engineering 10, 1107\u20131112 (1985)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"51_CR14","doi-asserted-by":"crossref","unstructured":"Young, N.E.: Sequential and parallel algorithms for mixed packing and covering. In: Proc. of the Symp. on Found. of Comp. Sci. (FOCS), pp. 538\u2013546. IEEE (2001)","DOI":"10.1109\/SFCS.2001.959930"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47666-6_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T15:23:28Z","timestamp":1674228208000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-47666-6_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476659","9783662476666"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47666-6_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}