{"id":"https://openalex.org/W4399521136","doi":"https://doi.org/10.1145/3618260.3649785","title":"Approximating Maximum Matching Requires Almost Quadratic Time","display_name":"Approximating Maximum Matching Requires Almost Quadratic Time","publication_year":2024,"publication_date":"2024-06-10","ids":{"openalex":"https://openalex.org/W4399521136","doi":"https://doi.org/10.1145/3618260.3649785"},"language":"en","primary_location":{"id":"doi:10.1145/3618260.3649785","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3618260.3649785","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649785","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649785","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025934584","display_name":"Soheil Behnezhad","orcid":"https://orcid.org/0000-0002-0104-633X"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Soheil Behnezhad","raw_affiliation_strings":["Northeastern University, Boston, USA"],"raw_orcid":"https://orcid.org/0000-0002-0104-633X","affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, USA","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070654443","display_name":"Mohammad Roghani","orcid":"https://orcid.org/0000-0001-8247-3773"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohammad Roghani","raw_affiliation_strings":["Stanford University, Stanford, USA"],"raw_orcid":"https://orcid.org/0000-0001-8247-3773","affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035432679","display_name":"Aviad Rubinstein","orcid":"https://orcid.org/0000-0002-6900-8612"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aviad Rubinstein","raw_affiliation_strings":["Stanford University, Stanford, USA"],"raw_orcid":"https://orcid.org/0000-0002-6900-8612","affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3629,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.76430466,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"444","last_page":"454"},"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.9997000098228455,"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.9997000098228455,"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.9986000061035156,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7022330164909363},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6488456130027771},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.637606143951416},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.546237051486969},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5111883282661438},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.4457453489303589},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4381023943424225},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43002089858055115},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2801966965198517},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.15990430116653442}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7022330164909363},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6488456130027771},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.637606143951416},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.546237051486969},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5111883282661438},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.4457453489303589},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4381023943424225},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43002089858055115},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2801966965198517},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.15990430116653442},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3618260.3649785","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3618260.3649785","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649785","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3618260.3649785","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3618260.3649785","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649785","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4399521136.pdf"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1539682630","https://openalex.org/W1966695467","https://openalex.org/W1980155175","https://openalex.org/W1984416451","https://openalex.org/W2003813631","https://openalex.org/W2023146810","https://openalex.org/W2047281923","https://openalex.org/W2053050060","https://openalex.org/W2056168287","https://openalex.org/W2109330224","https://openalex.org/W3001104546","https://openalex.org/W3037800180","https://openalex.org/W3167715268","https://openalex.org/W4316652263","https://openalex.org/W4316652350","https://openalex.org/W4316652364","https://openalex.org/W4376639521","https://openalex.org/W4376639608","https://openalex.org/W4390098179","https://openalex.org/W4390098433","https://openalex.org/W4390575884"],"related_works":["https://openalex.org/W2611163850","https://openalex.org/W1845849701","https://openalex.org/W3015250136","https://openalex.org/W1980812295","https://openalex.org/W2044218713","https://openalex.org/W2625268413","https://openalex.org/W2962989220","https://openalex.org/W2379234996","https://openalex.org/W4247900000","https://openalex.org/W1550139912"],"abstract_inverted_index":{"We":[0],"study":[1],"algorithms":[2],"for":[3,59,111],"estimating":[4,128],"the":[5,37,49,71,78,98,129,145],"size":[6,130],"of":[7,36,51,100,131,138],"maximum":[8,132],"matching.":[9],"This":[10],"problem":[11],"has":[12],"been":[13],"subject":[14],"to":[15,70,104],"extensive":[16],"research.":[17],"For":[18],"n-vertex":[19],"graphs,":[20],"Bhattacharya,":[21],"Kiss,":[22],"and":[23,68,86,95],"Saranurak":[24],"[FOCS\u201923]":[25],"(BKS)":[26],"showed":[27],"that":[28,31,76,97,110,127],"an":[29,135],"estimate":[30],"is":[32,48,55,83,102,118],"within":[33,134],"\u0454":[34,62,82,121,139],"n":[35,47,58,140],"optimal":[38],"solution":[39],"can":[40],"be":[41],"achieved":[42],"in":[43,57,144],"n2\u2212\u03a9\u0454(1)":[44],"time,":[45],"where":[46],"number":[50],"vertices.":[52],"While":[53],"this":[54,89,93],"subquadratic":[56],"any":[60,112],"fixed":[61,113,120],">":[63,115,124],"0,":[64,116],"it":[65],"gets":[66],"closer":[67,69],"trivial":[72],"\u0398(n2)":[73],"time":[74,143],"algorithm":[75,99],"reads":[77],"entire":[79],"input":[80],"as":[81],"made":[84],"smaller":[85],"smaller.":[87],"In":[88,106],"work,":[90],"we":[91,108],"close":[92,103],"gap":[94],"show":[96],"BKS":[101],"optimal.":[105],"particular,":[107],"prove":[109],"\u03b4":[114],"there":[117],"another":[119],"=":[122],"\u0454(\u03b4)":[123],"0":[125],"such":[126],"matching":[133],"additive":[136],"error":[137],"requires":[141],"\u03a9(n2\u2212\u03b4)":[142],"adjacency":[146],"list":[147],"model.":[148]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}