{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:41:19Z","timestamp":1725745279383},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642403279"},{"type":"electronic","value":"9783642403286"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40328-6_19","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T09:17:34Z","timestamp":1376644654000},"page":"260-273","source":"Crossref","is-referenced-by-count":20,"title":["A Local Computation Approximation Scheme to Maximum Matching"],"prefix":"10.1007","author":[{"given":"Yishay","family":"Mansour","sequence":"first","affiliation":[]},{"given":"Shai","family":"Vardi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","volume":"7","author":"N. Alon","year":"1986","unstructured":"Alon, N., Babai, L., Itai, A.: A fast and simple randomized algorithm for the maximal independent set problem. Journal of Algorithms\u00a07, 567\u2013583 (1986)","journal-title":"Journal of Algorithms"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Rubinfeld, R., Vardi, S., Xie, N.: Space-efficient local computation algorithms. In: Proc. 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1132\u20131139 (2012)","DOI":"10.1137\/1.9781611973099.89"},{"issue":"9","key":"19_CR3","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1073\/pnas.43.9.842","volume":"43","author":"C. Berge","year":"1957","unstructured":"Berge, C.: Two theorems in graph theory. Proceedings of the National Academy of Sciences of the United States of America\u00a043(9), 842\u2013844 (1957)","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-45071-8_26","volume-title":"Computing and Combinatorics","author":"A. Czygrinow","year":"2003","unstructured":"Czygrinow, A., Hanckowiak, M.: Distributed algorithm for better approximation of the maximum matching. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol.\u00a02697, pp. 242\u2013251. Springer, Heidelberg (2003)"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Canadian Journal of Mathematics\u00a017, 449\u2013467 (1965)","journal-title":"Canadian Journal of Mathematics"},{"issue":"1","key":"19_CR6","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P. Hall","year":"1935","unstructured":"Hall, P.: On representatives of subsets. J. London Math. Soc.\u00a010(1), 26\u201330 (1935)","journal-title":"J. London Math. Soc."},{"key":"19_CR7","unstructured":"Harvey, N.: Algebraic structures and algorithms for matching and matroid problems. In: Proc. 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 531\u2013542 (2006)"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/11780823_10","volume-title":"Structural Information and Communication Complexity","author":"J.-H. Hoepman","year":"2006","unstructured":"Hoepman, J.-H., Kutten, S., Lotker, Z.: Efficient distributed weighted matchings on trees. In: Flocchini, P., G\u0105sieniec, L. (eds.) SIROCCO 2006. LNCS, vol.\u00a04056, pp. 115\u2013129. Springer, Heidelberg (2006)"},{"issue":"4","key":"19_CR9","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An N\n                  5\/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing\u00a02(4), 225\u2013231 (1973)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"19_CR10","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. Process. Lett.\u00a022(2), 77\u201380 (1986)","journal-title":"Inf. Process. Lett."},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: The price of being near-sighted. In: Proc. 17th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 980\u2013989 (2006)","DOI":"10.1145\/1109557.1109666"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H.W. Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The hungarian method for the assignment problem. Naval Research Logistics Quarterly\u00a02, 83\u201397 (1955)","journal-title":"Naval Research Logistics Quarterly"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Lotker, Z., Patt-Shamir, B., Pettie, S.: Improved distributed approximate matching. In: Proc. 20th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 129\u2013136 (2008)","DOI":"10.1145\/1378533.1378558"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/978-3-642-31594-7_55","volume-title":"Automata, Languages, and Programming","author":"Y. Mansour","year":"2012","unstructured":"Mansour, Y., Rubinstein, A., Vardi, S., Xie, N.: Converting online algorithms to local computation algorithms. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part I. LNCS, vol.\u00a07391, pp. 653\u2013664. Springer, Heidelberg (2012)"},{"key":"19_CR15","unstructured":"Mansour, Y., Vardi, S.: Local algorithmic mechanism design. Under submission elsewhere"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Micali, S., Vazirani, V.V.: An \n                    \n                      \n                    \n                    $O(\\sqrt{|V|} |E|)$\n                   algorithm for finding maximum matching in general graphs. In: Proc. 21st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 17\u201327 (1980)","DOI":"10.1109\/SFCS.1980.12"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Mucha, M., Sankowski, P.: Maximum matchings via gaussian elimination. In: FOCS, pp. 248\u2013255 (2004)","DOI":"10.1007\/978-3-540-30140-0_48"},{"issue":"1","key":"19_CR18","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1137\/0105003","volume":"5","author":"J. Munkres","year":"1957","unstructured":"Munkres, J.: Algorithms for the assignment and transportation problems. Journal of the Society for Industrial and Applied Mathematics\u00a05(1), 32\u201338 (1957)","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Nguyen, H.N., Onak, K.: Constant-time approximation algorithms via local improvements. In: Proc. 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 327\u2013336 (2008)","DOI":"10.1109\/FOCS.2008.81"},{"key":"19_CR20","unstructured":"Rubinfeld, R., Tamir, G., Vardi, S., Xie, N.: Fast local computation algorithms. In: Proc. 2nd Symposium on Innovations in Computer Science (ICS), pp. 223\u2013238 (2011)"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40328-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T13:50:48Z","timestamp":1558014648000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40328-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403279","9783642403286"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40328-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}