{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:05:01Z","timestamp":1750694701353,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T00:00:00Z","timestamp":1275696000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,6,5]]},"DOI":"10.1145\/1806689.1806741","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"369-378","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Matroid matching"],"prefix":"10.1145","author":[{"given":"Jon","family":"Lee","sequence":"first","affiliation":[{"name":"IBM Watson Research Center, Yorktown Heights, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maxim","family":"Sviridenko","sequence":"additional","affiliation":[{"name":"IBM Watson Research Center, Yorktown Heights, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Vondrak","sequence":"additional","affiliation":[{"name":"IBM Almaden Research Center, San Jose, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.23.3.640"},{"key":"e_1_3_2_1_2_1","volume-title":"On maximum matching, minimum covering and their connections, in \"Proceedings of Princeton Symposium on Mathematical Programming,\" Eds. H. Kuhn, 303--312","author":"Balinski M.","year":"1970","unstructured":"M. Balinski , On maximum matching, minimum covering and their connections, in \"Proceedings of Princeton Symposium on Mathematical Programming,\" Eds. H. Kuhn, 303--312 , Princeton Univ. Press , Princeton, NJ , 1970 . M. Balinski, On maximum matching, minimum covering and their connections, in \"Proceedings of Princeton Symposium on Mathematical Programming,\" Eds. H. Kuhn, 303--312, Princeton Univ. Press, Princeton, NJ, 1970."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(96)00063-7"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585571"},{"issue":"3","key":"e_1_3_2_1_5_1","first-page":"178","article-title":"approximation for maximum weight independent set in d-claw free graphs","volume":"7","author":"Berman P.","year":"2000","unstructured":"P. Berman , A d\/2 approximation for maximum weight independent set in d-claw free graphs , Nordic J. Comput. 7 ( 3 ) ( 2000 ), 178 -- 184 . P. Berman, A d\/2 approximation for maximum weight independent set in d-claw free graphs, Nordic J. Comput. 7(3) (2000), 178--184.","journal-title":"Nordic J. Comput."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11753728_10"},{"key":"e_1_3_2_1_7_1","volume-title":"Maximizing a submodular set function subject to a matroid constraint, to appear in SIAM Journal on Computing, special issue for STOC","author":"Calinescu G.","year":"2008","unstructured":"G. Calinescu , C. Chekuri , M. Pal and J. Vondrak , Maximizing a submodular set function subject to a matroid constraint, to appear in SIAM Journal on Computing, special issue for STOC 2008 . G. Calinescu, C. Chekuri, M. Pal and J. Vondrak, Maximizing a submodular set function subject to a matroid constraint, to appear in SIAM Journal on Computing, special issue for STOC 2008."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(92)90018-8"},{"key":"e_1_3_2_1_9_1","volume-title":"On linear and semidefinite programming relaxations for hypergraph matching, to appear in SODA","author":"Chan Y.H.","year":"2010","unstructured":"Y.H. Chan and L.C. Lau , On linear and semidefinite programming relaxations for hypergraph matching, to appear in SODA 2010 . Y.H. Chan and L.C. Lau, On linear and semidefinite programming relaxations for hypergraph matching, to appear in SODA 2010."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1155"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(00)00219-3"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(00)00220-X"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(73)90167-2"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(89)90476-X"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1965-045-4"},{"key":"e_1_3_2_1_16_1","first-page":"73","article-title":"Maximum matching and a polyhedron with 0-1 vertices, Journal of Research National Bureau of Standards","volume":"69","author":"Edmonds J.","year":"1965","unstructured":"J. Edmonds , Maximum matching and a polyhedron with 0-1 vertices, Journal of Research National Bureau of Standards , Section B 69 , 73 -- 77 , 1965 . J. Edmonds, Maximum matching and a polyhedron with 0-1 vertices, Journal of Research National Bureau of Standards, Section B 69, 73--77, 1965.","journal-title":"Section B"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-003-0020-5"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0121195"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/646336.688260"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579169"},{"key":"e_1_3_2_1_22_1","volume-title":"Cornell University","author":"Hartmann M.","year":"1988","unstructured":"M. Hartmann , \"Cutting Plane Proofs and the Complexity of the Integer Hull,\" Ph.D. Thesis , Cornell University , Ithaca , 1988 . M. Hartmann, \"Cutting Plane Proofs and the Complexity of the Integer Hull,\" Ph.D. Thesis, Cornell University, Ithaca, 1988."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120891"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-006-0205-6"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/0402008"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/0211014"},{"key":"e_1_3_2_1_28_1","volume-title":"The efficacy of the \"greedy\" algorithm, in: \"Proc. of 7th South Eastern Conference on Combinatorics, Graph Theory and Computing,\" 341--350","author":"Jenkyns T.A.","year":"1976","unstructured":"T.A. Jenkyns , The efficacy of the \"greedy\" algorithm, in: \"Proc. of 7th South Eastern Conference on Combinatorics, Graph Theory and Computing,\" 341--350 , 1976 . T.A. Jenkyns, The efficacy of the \"greedy\" algorithm, in: \"Proc. of 7th South Eastern Conference on Combinatorics, Graph Theory and Computing,\" 341--350, 1976."},{"key":"e_1_3_2_1_29_1","volume-title":"Integrality gaps of linear and semi-definite programming relaxations for knapsack, manuscript","author":"Karlin A.","year":"2009","unstructured":"A. Karlin , C. Mathieu and C. Thach Nguyen , Integrality gaps of linear and semi-definite programming relaxations for knapsack, manuscript , 2009 . A. Karlin, C. Mathieu and C. Thach Nguyen, Integrality gaps of linear and semi-definite programming relaxations for knapsack, manuscript, 2009."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.28.3.470.16391"},{"key":"e_1_3_2_1_31_1","volume-title":"Rinehart and Winston","author":"Lawler E.L.","year":"1976","unstructured":"E.L. Lawler , \"Combinatorial Optimization : Networks and Matroids,\" Holt , Rinehart and Winston , New York , 1976 . E.L. Lawler, \"Combinatorial Optimization: Networks and Matroids,\" Holt, Rinehart and Winston, New York, 1976."},{"key":"e_1_3_2_1_32_1","volume-title":"Memo. No. ERL-M334, Electronics Research Laboratory","author":"Lawler E.L.","year":"1971","unstructured":"E.L. Lawler , Matroids with parity conditions: a new class of combinatorial optimization problems , Memo. No. ERL-M334, Electronics Research Laboratory , College of Engineering , UC Berkeley, 1971 . E.L. Lawler, Matroids with parity conditions: a new class of combinatorial optimization problems, Memo. No. ERL-M334, Electronics Research Laboratory, College of Engineering, UC Berkeley, 1971."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03685-9_19"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(80)90066-0"},{"key":"e_1_3_2_1_35_1","volume-title":"The matroid matching problem","author":"Lovasz L.","year":"1978","unstructured":"L. Lovasz , The matroid matching problem . In: L. Lovasz, L., V.T. Sos (Eds.), \"Algebraic Methods in Graph Theory, Vol. II ,\" (Colloquium Szeged, 24--31 August 1978 ). Colloquia, Mathematica Societatis Janos Bolyai 25, North--Holland, Amsterdam , 495--517, 1981. L. Lovasz, The matroid matching problem. In: L. Lovasz, L., V.T. Sos (Eds.), \"Algebraic Methods in Graph Theory, Vol. II,\" (Colloquium Szeged, 24--31 August 1978). Colloquia, Mathematica Societatis Janos Bolyai 25, North--Holland, Amsterdam, 495--517, 1981."},{"key":"e_1_3_2_1_36_1","article-title":"Matching Theory","volume":"29","author":"Lovasz L.","unstructured":"L. Lovasz and M.D. Plummer , \" Matching Theory ,\" Annals of Discrete Mathematics 29 , North-Holland, Amsterdam, 1986. L. Lovasz and M.D. Plummer, \"Matching Theory,\" Annals of Discrete Mathematics 29, North-Holland, Amsterdam, 1986.","journal-title":"Annals of Discrete Mathematics"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536456"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_48"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791195245"},{"key":"e_1_3_2_1_40_1","series-title":"Lecture Notes in Computer Science 5035","volume-title":"\"Proceedings of the The 13th Conference on Integer Programming and Combinatorial Optimization,\" (Bertinoro, Italy, 26--28","author":"Orlin J.B.","year":"2008","unstructured":"J.B. Orlin , A fast, simpler algorithm for the matroid parity problem , In: A. Lodi, A. Panconesi and G. Rinaldi (Eds.), \"Proceedings of the The 13th Conference on Integer Programming and Combinatorial Optimization,\" (Bertinoro, Italy, 26--28 May 2008 ), Lecture Notes in Computer Science 5035 , 2008, 240--258. J.B. Orlin, A fast, simpler algorithm for the matroid parity problem, In: A. Lodi, A. Panconesi and G. Rinaldi (Eds.), \"Proceedings of the The 13th Conference on Integer Programming and Combinatorial Optimization,\" (Bertinoro, Italy, 26--28 May 2008), Lecture Notes in Computer Science 5035, 2008, 240--258."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580854"},{"key":"e_1_3_2_1_42_1","volume-title":"Springer Verlag","author":"Recski A.","year":"1989","unstructured":"A. Recski , \"Matroid theory and its applications in electric network theory and in statics,\" Algorithms and Combinatorics 6 , Springer Verlag , Berlin , 1989 . A. Recski, \"Matroid theory and its applications in electric network theory and in statics,\" Algorithms and Combinatorics 6, Springer Verlag, Berlin, 1989."},{"key":"e_1_3_2_1_43_1","volume-title":"A. Bondy, J. Fonlupt, J.-L. Fouquet, J.-C","author":"Recski A.","year":"2004","unstructured":"A. Recski and J. Szabo , On the generalization of the matroid parity problem . In: A. Bondy, J. Fonlupt, J.-L. Fouquet, J.-C . Fournier, J.L. Ram\u00efrez Alfons\u00efn (Eds.), \"Graph Theory in Paris,\" (Proceedings of a Conference in Memory of Claude Berge, Paris, 5--9 July 2004 ), Trends in Mathematics, Birkhauser , Basel, 2007, 347--354. A. Recski and J. Szabo, On the generalization of the matroid parity problem. In: A. Bondy, J. Fonlupt, J.-L. Fouquet, J.-C. Fournier, J.L. Ram\u00efrez Alfons\u00efn (Eds.), \"Graph Theory in Paris,\" (Proceedings of a Conference in Memory of Claude Berge, Paris, 5--9 July 2004), Trends in Mathematics, Birkhauser, Basel, 2007, 347--354."},{"key":"e_1_3_2_1_44_1","unstructured":"A. Schrijver \"Theory of Linear and Integer Programming \" Wiley 1986.   A. Schrijver \"Theory of Linear and Integer Programming \" Wiley 1986."},{"key":"e_1_3_2_1_45_1","volume-title":"Polyhedra and Efficiency,\" Springer-Verlag","author":"Schrijver A.","year":"2003","unstructured":"A. Schrijver , \"Combinatorial Optimization : Polyhedra and Efficiency,\" Springer-Verlag , Berlin , 2003 . A. Schrijver, \"Combinatorial Optimization: Polyhedra and Efficiency,\" Springer-Verlag, Berlin, 2003."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1137\/0403036"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1984.715918"},{"key":"e_1_3_2_1_48_1","volume-title":"Progress in combinatorial optimization (Waterloo, Ont.","author":"Tong P.","year":"1982","unstructured":"P. Tong , E. Lawler and V. Vazirani , Solving the Weighted Parity Problem for Gammoids by Reduction to Graphic Matching , In Progress in combinatorial optimization (Waterloo, Ont. , 1982 ), 363--374, Academic Press (Toronto , ON ), 1984. P. Tong, E. Lawler and V. Vazirani, Solving the Weighted Parity Problem for Gammoids by Reduction to Graphic Matching, In Progress in combinatorial optimization (Waterloo, Ont., 1982), 363--374, Academic Press (Toronto, ON), 1984."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(92)90037-X"},{"key":"e_1_3_2_1_50_1","unstructured":"V.V. Vazirani \"Approximation Algorithms \" Springer-Verlag Berlin 2001.   V.V. Vazirani \"Approximation Algorithms \" Springer-Verlag Berlin 2001."},{"key":"e_1_3_2_1_51_1","unstructured":"D.J.A. Welsh \"Matroid Theory \" Academic Press London-New York 1976.  D.J.A. Welsh \"Matroid Theory \" Academic Press London-New York 1976."},{"key":"e_1_3_2_1_52_1","volume-title":"Inc.","author":"Williamson S.G.","year":"2002","unstructured":"S.G. Williamson , \"Combinatorics for computer science,\" Reprint of the 1985 original {Comput. Sci. Press, Rockville, MD}. Dover Publications , Inc. , Mineola, NY , 2002 . S.G. Williamson, \"Combinatorics for computer science,\" Reprint of the 1985 original {Comput. Sci. Press, Rockville, MD}. Dover Publications, Inc., Mineola, NY, 2002."}],"event":{"name":"STOC'10: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Cambridge Massachusetts USA","acronym":"STOC'10"},"container-title":["Proceedings of the forty-second ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806741","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1806689.1806741","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:37Z","timestamp":1750246777000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806741"}},"subtitle":["the power of local search"],"short-title":[],"issued":{"date-parts":[[2010,6,5]]},"references-count":50,"alternative-id":["10.1145\/1806689.1806741","10.1145\/1806689"],"URL":"https:\/\/doi.org\/10.1145\/1806689.1806741","relation":{},"subject":[],"published":{"date-parts":[[2010,6,5]]},"assertion":[{"value":"2010-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}