{"id":"https://openalex.org/W4376639608","doi":"https://doi.org/10.1145/3564246.3585231","title":"Sublinear Time Algorithms and Complexity of Approximate Maximum Matching","display_name":"Sublinear Time Algorithms and Complexity of Approximate Maximum Matching","publication_year":2023,"publication_date":"2023-05-16","ids":{"openalex":"https://openalex.org/W4376639608","doi":"https://doi.org/10.1145/3564246.3585231"},"language":"en","primary_location":{"id":"doi:10.1145/3564246.3585231","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585231","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585231","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th 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/3564246.3585231","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, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeastern University, 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, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, 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, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, 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":4.72,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.96827766,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"267","last_page":"280"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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.9994000196456909,"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/T12288","display_name":"Optimization and Search Problems","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/sublinear-function","display_name":"Sublinear function","score":0.8194854259490967},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6646355390548706},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6478897929191589},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6478449702262878},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5977482199668884},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5874865055084229},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5812466740608215},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5742819309234619},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5569164156913757},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5474773049354553},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5187970995903015},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4802551567554474},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36373472213745117},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.27845028042793274},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.16807928681373596},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06761175394058228},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06177440285682678}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.8194854259490967},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6646355390548706},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6478897929191589},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6478449702262878},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5977482199668884},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5874865055084229},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5812466740608215},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5742819309234619},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5569164156913757},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5474773049354553},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5187970995903015},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4802551567554474},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36373472213745117},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27845028042793274},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.16807928681373596},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06761175394058228},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06177440285682678},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3564246.3585231","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585231","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585231","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3564246.3585231","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585231","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585231","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G378604186","display_name":null,"funder_award_id":"CCF-1954927","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7077839665","display_name":"Collaborative Research: AF: Medium: Modern Combinatorial Optimization: Incentives, Uncertainty, and Smoothed Analysis","funder_award_id":"1954927","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4376639608.pdf","grobid_xml":"https://content.openalex.org/works/W4376639608.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W1539682630","https://openalex.org/W2006603568","https://openalex.org/W2146507303","https://openalex.org/W2153715991","https://openalex.org/W2157529519","https://openalex.org/W2261727491","https://openalex.org/W2953253371","https://openalex.org/W2998414467","https://openalex.org/W3001104546","https://openalex.org/W4205734203","https://openalex.org/W4210631930","https://openalex.org/W4252630569","https://openalex.org/W4254539327","https://openalex.org/W4297952728","https://openalex.org/W4316652263","https://openalex.org/W4316652350","https://openalex.org/W4316652364","https://openalex.org/W4376639521"],"related_works":["https://openalex.org/W2056597184","https://openalex.org/W1712180277","https://openalex.org/W4376639521","https://openalex.org/W1608414128","https://openalex.org/W2029933769","https://openalex.org/W2551034790","https://openalex.org/W159504299","https://openalex.org/W3102280101","https://openalex.org/W2028468530","https://openalex.org/W1903284337"],"abstract_inverted_index":{"Sublinear":[0],"time":[1,42,63],"algorithms":[2],"for":[3,43,102],"approximating":[4],"maximum":[5,88],"matching":[6,89],"size":[7,90],"have":[8],"long":[9],"been":[10,25],"studied.":[11],"Much":[12],"of":[13,34,87],"the":[14,17,27,70],"progress":[15],"over":[16],"last":[18],"two":[19],"decades":[20],"on":[21,26],"this":[22],"problem":[23],"has":[24,104],"algorithmic":[28],"side.":[29],"For":[30],"instance,":[31],"an":[32],"algorithm":[33,49],"[Behnezhad;":[35],"FOCS\u201921]":[36],"obtains":[37,57],"a":[38,58],"1/2-approximation":[39],"in":[40,61,97],"O(n)":[41],"n-vertex":[44],"graphs.":[45],"A":[46],"more":[47],"recent":[48],"by":[50],"[Behnezhad,":[51],"Roghani,":[52],"Rubinstein,":[53],"and":[54,75],"Saberi;":[55],"SODA\u201923]":[56],"slightly-better-than-1/2":[59],"approximation":[60,86],"O(n1+\u0454)":[62],"(for":[64],"arbitrarily":[65],"small":[66],"constant":[67,85],"\u03b5>0).":[68],"On":[69],"lower":[71,99],"bound":[72],"side,":[73],"[Parnas":[74],"Ron;":[76],"TCS\u201907]":[77],"showed":[78],"15":[79],"years":[80],"ago":[81],"that":[82],"obtaining":[83],"any":[84,95],"requires":[91],"\u03a9(n)":[92],"time.":[93],"Proving":[94],"super-linear":[96],"n":[98],"bound,":[100],"even":[101],"(1\u2212\u0454)-approximations,":[103],"remained":[105],"elusive":[106],"since":[107],"then.":[108]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":2}],"updated_date":"2026-07-31T08:31:51.225901","created_date":"2025-10-10T00:00:00"}