{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:18:48Z","timestamp":1725664728550},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540614227"},{"type":"electronic","value":"9783540685296"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61422-2_136","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:37:11Z","timestamp":1330274231000},"page":"246-258","source":"Crossref","is-referenced-by-count":2,"title":["Optimal cost-sensitive distributed minimum spanning tree algorithm"],"prefix":"10.1007","author":[{"given":"Teresa","family":"Przytycka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lisa","family":"Higham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"B. Awerbuch. Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pages 230\u2013240, 1987.","DOI":"10.1145\/28395.28421"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, A. Baratz, and D. Peleg. Cost-sensitive analysis of communication protocols. In Proc. 9th Annual ACM Symp. on Principles of Distributed Computing, pages 177\u2013187, 1990.","DOI":"10.1145\/93385.93417"},{"issue":"6","key":"22_CR3","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0020-0190(88)90215-3","volume":"27","author":"H. L. Bodlaender","year":"1988","unstructured":"H. L. Bodlaender. A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors. Information Processing Letters, 27(6):287\u2013290, 1988.","journal-title":"Information Processing Letters"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"F. Chin and H. F. Ting. An almost linear time and O(n lg n + e) messages distributed algorithm for minimum weight spanning tree. In Proc. 26nd Annual Symp. on Foundations of Comput. Sci., pages 257\u2013266, 1985.","DOI":"10.1109\/SFCS.1985.7"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"M. Faloutsos and M. Molle. Optimal distributed algorithm for minimum spanning trees revisited. In Proc. 14th Annual ACM Symp. on Principles of Distributed Computing, pages 231\u2013237, 1995.","DOI":"10.1145\/224964.225474"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"E. Gafni. Improvements in the time complexity of two message-optimal election algorthms. In Proc. 4th Annual ACM Symp. on Principles of Distributed Computing, pages 175\u2013184, 1985.","DOI":"10.1145\/323596.323612"},{"issue":"1","key":"22_CR7","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"R. Gallager","year":"1983","unstructured":"R. Gallager, P. Humblet, and P. Spira. A distributed algorithm for minimum weight spanning trees. ACM Trans. on Prog. Lang. and Systems, 5(1):66\u201377, 1983.","journal-title":"ACM Trans. on Prog. Lang. and Systems"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"L. Higham and T. Przytycka. Asymptotically optimal election on weighted rings. In Lecture Notes in Computer Science #824, pages 207\u2013218. Springer Verlag, 1994. SWAT94, revised version to appear in SIAM J. Comp.","DOI":"10.1007\/3-540-58218-5_19"},{"issue":"4","key":"22_CR9","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1145\/1634.1889","volume":"31","author":"J. Pachl","year":"1984","unstructured":"J. Pachl, E. Korach, and D. Rotem. Lower bounds for distributed maximum finding. J. Assoc. Comput. Mach., 31(4):905\u2013918, 1984.","journal-title":"J. Assoc. Comput. Mach."},{"issue":"3","key":"22_CR10","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02242717","volume":"8","author":"G. Singh","year":"1995","unstructured":"G. Singh and A. J. Bernstein. A highly asynchronous minimum spanning tree protocol. Distributed Computing, 8(3):151\u2013161, 1995.","journal-title":"Distributed Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT'96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61422-2_136.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:06:02Z","timestamp":1605629162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61422-2_136"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614227","9783540685296"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-61422-2_136","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}