{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:27:42Z","timestamp":1787498862923,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540354741","type":"print"},{"value":"9783540354758","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780823_10","type":"book-chapter","created":{"date-parts":[[2006,6,23]],"date-time":"2006-06-23T10:45:59Z","timestamp":1151059559000},"page":"115-129","source":"Crossref","is-referenced-by-count":9,"title":["Efficient Distributed Weighted Matchings on Trees"],"prefix":"10.1007","author":[{"given":"Jaap-Henk","family":"Hoepman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shay","family":"Kutten","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zvi","family":"Lotker","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1002\/net.3230130404","volume":"13","author":"D. Avis","year":"1983","unstructured":"Avis, D.: A survey of heuristics for the weighted matching problem. Networks\u00a013, 475\u2013493 (1983)","journal-title":"Networks"},{"key":"10_CR2","first-page":"290","volume-title":"21st PODC","author":"S. Chattopadhyay","year":"2002","unstructured":"Chattopadhyay, S., Higham, L., Seyffarth, K.: Dynamic and self-stabilizing distributed matching. In: 21st PODC, Monterey, CA, USA, pp. 290\u2013297. ACM Press, New York (2002)"},{"key":"10_CR3","first-page":"434","volume-title":"1st SODA","author":"H. Gabow","year":"1990","unstructured":"Gabow, H.: Data structures for weighted matching and nearest common ancestors with linking. In: 1st SODA, San Fransisco, Ca., USA, pp. 434\u2013443. ACM Press, New York (1990)"},{"key":"10_CR4","volume-title":"19th STOC","author":"A.V. Goldberg","year":"1987","unstructured":"Goldberg, A.V., Plotkin, S., Shannon, G.: Parallel symmetry breaking in sparse graphs. In: 19th STOC, New York City, NY, USA. ACM Press, New York (1987)"},{"key":"10_CR5","unstructured":"Hoepman, J.-H. Simple distributed weighted matchings, eprint cs.DC\/0410047 (2004)"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0020-0190(86)90144-4","volume":"22","author":"A. Israeli","year":"1986","unstructured":"Israeli, A., Itai, A.: A fast and simple randomized parallel algorithm for maximal matching. Inf. Proc. Letters\u00a022, 77\u201380 (1986)","journal-title":"Inf. Proc. Letters"},{"key":"10_CR7","first-page":"175","volume":"3","author":"M. Karaata","year":"2000","unstructured":"Karaata, M., Saleh, K.: A distributed self-stabilizing algorithm for finding maximal matching. Computer Systems Science and Engineering\u00a03, 175\u2013180 (2000)","journal-title":"Computer Systems Science and Engineering"},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1006\/jagm.1998.0929","volume":"28","author":"S. Kutten","year":"1998","unstructured":"Kutten, S., Peleg, D.: Fast distributed construction of k-dominating sets and applications. Journal of Algorithms\u00a028(1), 40\u201366 (1998)","journal-title":"Journal of Algorithms"},{"key":"10_CR9","first-page":"17","volume-title":"21st FOCS","author":"S. Micali","year":"1980","unstructured":"Micali, S., Vazirani, V.: An \n                  \n                    \n                  \n                  $O(\\sqrt{V}E)$\n                 algorithm for finding maximum matching in general graphs. In: 21st FOCS, Syracuse, NY, USA, pp. 17\u201327. IEEE Computer Society Press, Los Alamitos (1980)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-49116-3_24","volume-title":"STACS 99","author":"R. Preis","year":"1999","unstructured":"Preis, R.: Linear time 1\/2-approximation algorithm for maximum weighted matching in general graphs. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 259\u2013269. Springer, Heidelberg (1999)"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0020-0190(00)00128-9","volume":"76","author":"R. Uehara","year":"2000","unstructured":"Uehara, R., Chen, Z.: Parallel approximation algorithms for maximum weighted matching in general graphs. Inf. Proc. Letters\u00a076, 13\u201317 (2000)","journal-title":"Inf. Proc. Letters"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-540-30186-8_24","volume-title":"Distributed Computing","author":"M. Wattenhofer","year":"2004","unstructured":"Wattenhofer, M., Wattenhofer, R.: Distributed weighted matching. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol.\u00a03274, pp. 335\u2013348. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780823_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:17:06Z","timestamp":1619493426000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780823_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354741","9783540354758"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11780823_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}