{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:01:50Z","timestamp":1725584510588},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_26","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T08:04:43Z","timestamp":1193472283000},"page":"242-251","source":"Crossref","is-referenced-by-count":8,"title":["Distributed Algorithm for Better Approximation of the Maximum Matching"],"prefix":"10.1007","author":[{"given":"A.","family":"Czygrinow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Ha\u0144\u0107kowiak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"A. Czygrinow, M. Ha\u0144\u0107kowiak, E. Szyma\u0144ska, Distributed algorithm for approximating the maximum matching, submitted, 2002.","key":"26_CR1","DOI":"10.1007\/3-540-45071-8_26"},{"key":"26_CR2","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0020-0190(93)90055-E","volume":"46","author":"T. Fischer","year":"1993","unstructured":"T. Fischer, A. V. Goldberg, D. J. Haglin, S. Plotkin, Approximating matchings in parallel, Information Processing Letters, 1993, 46, pp. 115\u2013118.","journal-title":"Information Processing Letters"},{"unstructured":"M. Ha\u0144\u0107kowiak, M. Karo\u0144ski, A. Panconesi, A faster distributed algorithm for computing maximal matching deterministically, Proceedings of PODC 99, the Eighteen Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 219\u2013228.","key":"26_CR3"},{"issue":"1","key":"26_CR4","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N. Linial","year":"1992","unstructured":"N. Linial, Locality in distributed graph algorithms, SIAM Journal on Computing, 1992, 21(1), pp. 193\u2013201.","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T02:09:10Z","timestamp":1556935750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}