{"id":"https://openalex.org/W2047281923","doi":"https://doi.org/10.1145/2529989","title":"Linear-Time Approximation for Maximum Weight Matching","display_name":"Linear-Time Approximation for Maximum Weight Matching","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2047281923","doi":"https://doi.org/10.1145/2529989","mag":"2047281923"},"language":"en","primary_location":{"id":"doi:10.1145/2529989","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2529989","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101897550","display_name":"Ran Duan","orcid":"https://orcid.org/0009-0007-0934-0684"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ran Duan","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076564426","display_name":"Seth Pettie","orcid":"https://orcid.org/0000-0002-0495-3904"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Seth Pettie","raw_affiliation_strings":["University of Michigan","(University of Michigan)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"(University of Michigan)","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":26.0876,"has_fulltext":false,"cited_by_count":270,"citation_normalized_percentile":{"value":0.99766532,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"61","issue":"1","first_page":"1","last_page":"23"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.7664806246757507},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.7279782295227051},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6441324353218079},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6323965787887573},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5865899324417114},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5838594436645508},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5483582019805908},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.4627056419849396},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4466366171836853},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42628753185272217},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24557551741600037},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1480308473110199},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06302464008331299}],"concepts":[{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.7664806246757507},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7279782295227051},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6441324353218079},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6323965787887573},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5865899324417114},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5838594436645508},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5483582019805908},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.4627056419849396},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4466366171836853},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42628753185272217},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24557551741600037},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1480308473110199},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06302464008331299},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2529989","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2529989","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.428.7880","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.428.7880","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.eecs.umich.edu/~pettie/papers/ApproxMWM-JACM.pdf","raw_type":"text"},{"id":"pmh:oai:escidoc.org:escidoc:2072380","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0024-3CEA-B","pdf_url":null,"source":{"id":"https://openalex.org/S7407052962","display_name":"Max Planck Digital Library","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G481901015","display_name":null,"funder_award_id":"CCF-0746673","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"},{"id":"https://openalex.org/G6993444347","display_name":null,"funder_award_id":"CCF-1217338","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"}],"funders":[{"id":"https://openalex.org/F4320308269","display_name":"Alexander von Humboldt-Stiftung","ror":"https://ror.org/012kf4317"},{"id":"https://openalex.org/F4320320950","display_name":"United States-Israel Binational Science Foundation","ror":"https://ror.org/00j8z2m73"},{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":107,"referenced_works":["https://openalex.org/W39321544","https://openalex.org/W125735179","https://openalex.org/W136000211","https://openalex.org/W1485041102","https://openalex.org/W1494735819","https://openalex.org/W1499313444","https://openalex.org/W1505310183","https://openalex.org/W1541277988","https://openalex.org/W1558378280","https://openalex.org/W1563315847","https://openalex.org/W1782486463","https://openalex.org/W1866422804","https://openalex.org/W1963503748","https://openalex.org/W1964119857","https://openalex.org/W1969357318","https://openalex.org/W1972978715","https://openalex.org/W1973907457","https://openalex.org/W1976437885","https://openalex.org/W1978715699","https://openalex.org/W1980675521","https://openalex.org/W1981479258","https://openalex.org/W1984735486","https://openalex.org/W1984816083","https://openalex.org/W1991111385","https://openalex.org/W1992294614","https://openalex.org/W1993675745","https://openalex.org/W1999545213","https://openalex.org/W1999848117","https://openalex.org/W2001139415","https://openalex.org/W2001681959","https://openalex.org/W2003813631","https://openalex.org/W2013479076","https://openalex.org/W2014533003","https://openalex.org/W2023810039","https://openalex.org/W2024106841","https://openalex.org/W2024607148","https://openalex.org/W2028468530","https://openalex.org/W2028503265","https://openalex.org/W2029132631","https://openalex.org/W2029574370","https://openalex.org/W2032382962","https://openalex.org/W2037576616","https://openalex.org/W2038073775","https://openalex.org/W2040217797","https://openalex.org/W2040326319","https://openalex.org/W2041670460","https://openalex.org/W2041785146","https://openalex.org/W2041786457","https://openalex.org/W2047239272","https://openalex.org/W2048590231","https://openalex.org/W2051292994","https://openalex.org/W2052821518","https://openalex.org/W2054420170","https://openalex.org/W2055536684","https://openalex.org/W2057869046","https://openalex.org/W2059608229","https://openalex.org/W2063748721","https://openalex.org/W2064284095","https://openalex.org/W2070232376","https://openalex.org/W2073705438","https://openalex.org/W2076088024","https://openalex.org/W2084224084","https://openalex.org/W2085201606","https://openalex.org/W2090010485","https://openalex.org/W2091299439","https://openalex.org/W2096046208","https://openalex.org/W2098645185","https://openalex.org/W2106522282","https://openalex.org/W2111366547","https://openalex.org/W2116450608","https://openalex.org/W2117226423","https://openalex.org/W2123452111","https://openalex.org/W2124852572","https://openalex.org/W2125690626","https://openalex.org/W2126169247","https://openalex.org/W2130257319","https://openalex.org/W2139559590","https://openalex.org/W2140794423","https://openalex.org/W2141461755","https://openalex.org/W2149342630","https://openalex.org/W2157529519","https://openalex.org/W2163318198","https://openalex.org/W2166703666","https://openalex.org/W2167937495","https://openalex.org/W2169528473","https://openalex.org/W2222512263","https://openalex.org/W2247955125","https://openalex.org/W2313349758","https://openalex.org/W2327315803","https://openalex.org/W2328725012","https://openalex.org/W2335597645","https://openalex.org/W2427045451","https://openalex.org/W2493312408","https://openalex.org/W2569130577","https://openalex.org/W2624301084","https://openalex.org/W2952376370","https://openalex.org/W2963577143","https://openalex.org/W2995414748","https://openalex.org/W3014094413","https://openalex.org/W3113130260","https://openalex.org/W4233756358","https://openalex.org/W4244424643","https://openalex.org/W4249528565","https://openalex.org/W4251770758","https://openalex.org/W6630381431","https://openalex.org/W6637407823","https://openalex.org/W6680004793"],"related_works":["https://openalex.org/W3135784370","https://openalex.org/W4287273005","https://openalex.org/W2776473626","https://openalex.org/W1966028935","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W2583914519"],"abstract_inverted_index":{"The":[0],"maximum":[1,4,73,105],"cardinality":[2],"and":[3,31,38,112],"weight":[5,74,106],"matching":[6,75,107],"problems":[7],"can":[8,52,120],"be":[9,53,114],"solved":[10],"in":[11,76,116],"\u00d5":[12],"(":[13,78],"m":[14,30,48],"\u221a":[15,49],"n":[16,32,50],")":[17,84],"time,":[18,85],"a":[19,68,122],"bound":[20],"that":[21,45,66,86,119],"has":[22],"resisted":[23],"improvement":[24],"despite":[25],"decades":[26],"of":[27,36],"research.":[28],"(Here":[29],"are":[33],"the":[34,102],"number":[35],"edges":[37],"vertices.)":[39],"In":[40],"this":[41,46],"article,":[42],"we":[43,62],"demonstrate":[44],"\u201c":[47],"barrier\u201d":[51],"bypassed":[54],"by":[55],"approximation.":[56],"For":[57],"any":[58,92],"\u03b5":[59,71,82,94],">":[60],"0,":[61],"give":[63],"an":[64],"algorithm":[65,97],"computes":[67],"(1":[69],"\u2212":[70],")-approximate":[72],"O":[77],"m\u03b5":[79],"\u22121":[80,83],"log":[81],"is,":[87],"optimal":[88],"linear":[89],"time":[90],"for":[91],"fixed":[93],".":[95],"Our":[96],"is":[98],"dramatically":[99],"simpler":[100],"than":[101],"best":[103],"exact":[104],"algorithms":[108],"on":[109],"general":[110],"graphs":[111],"should":[113],"appealing":[115],"all":[117],"applications":[118],"tolerate":[121],"negligible":[123],"relative":[124],"error.":[125]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":22},{"year":2024,"cited_by_count":24},{"year":2023,"cited_by_count":22},{"year":2022,"cited_by_count":24},{"year":2021,"cited_by_count":40},{"year":2020,"cited_by_count":20},{"year":2019,"cited_by_count":21},{"year":2018,"cited_by_count":20},{"year":2017,"cited_by_count":18},{"year":2016,"cited_by_count":23},{"year":2015,"cited_by_count":24},{"year":2014,"cited_by_count":8}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}