{"id":"https://openalex.org/W4376639521","doi":"https://doi.org/10.1145/3564246.3585252","title":"Sublinear Algorithms for (1.5+\ud835\udf16)-Approximate Matching","display_name":"Sublinear Algorithms for (1.5+\ud835\udf16)-Approximate Matching","publication_year":2023,"publication_date":"2023-05-16","ids":{"openalex":"https://openalex.org/W4376639521","doi":"https://doi.org/10.1145/3564246.3585252"},"language":"en","primary_location":{"id":"doi:10.1145/3564246.3585252","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3564246.3585252","pdf_url":null,"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":"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/A5103251160","display_name":"Sayan Bhattacharya","orcid":"https://orcid.org/0000-0003-1612-0296"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Sayan Bhattacharya","raw_affiliation_strings":["University of Warwick, UK"],"affiliations":[{"raw_affiliation_string":"University of Warwick, UK","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026856828","display_name":"P\u00e9ter Kiss","orcid":"https://orcid.org/0009-0005-6488-9990"},"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"]},{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["DE","GB"],"is_corresponding":false,"raw_author_name":"Peter Kiss","raw_affiliation_strings":["University of Warwick, UK / MPI-INF, Germany"],"affiliations":[{"raw_affiliation_string":"University of Warwick, UK / MPI-INF, Germany","institution_ids":["https://openalex.org/I39555362","https://openalex.org/I4210109712"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010547647","display_name":"Thatchaphol Saranurak","orcid":"https://orcid.org/0000-0001-8386-7168"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thatchaphol Saranurak","raw_affiliation_strings":["University of Michigan, USA"],"affiliations":[{"raw_affiliation_string":"University of Michigan, USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5103251160"],"corresponding_institution_ids":["https://openalex.org/I39555362"],"apc_list":null,"apc_paid":null,"fwci":1.573,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.85367715,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"254","last_page":"266"},"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.9998999834060669,"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.9998999834060669,"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.9977999925613403,"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"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9283046722412109},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7434555292129517},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.7431358098983765},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.5374017953872681},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4785093367099762},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.4693487584590912},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4613708257675171},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4528341293334961},{"id":"https://openalex.org/keywords/approximation-theory","display_name":"Approximation theory","score":0.426942378282547},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4261074960231781},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3608250617980957},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3465767204761505},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.335502028465271},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.18677419424057007},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.11077025532722473},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07311844825744629}],"concepts":[{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.9283046722412109},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7434555292129517},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7431358098983765},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.5374017953872681},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4785093367099762},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.4693487584590912},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4613708257675171},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4528341293334961},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.426942378282547},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4261074960231781},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3608250617980957},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3465767204761505},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.335502028465271},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.18677419424057007},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.11077025532722473},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07311844825744629},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3564246.3585252","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3564246.3585252","pdf_url":null,"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"},{"id":"pmh:oai:wrap.warwick.ac.uk:175054","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Conference Item"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1934935867","display_name":null,"funder_award_id":"Engineering and Physical Sciences R","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G3947296455","display_name":"Theory and Applications of Dynamic Algorithms","funder_award_id":"EP/S03353X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G4593055465","display_name":null,"funder_award_id":"UK (EPSRC) Grant EP/S03353X/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W853930207","https://openalex.org/W1980155175","https://openalex.org/W1999799345","https://openalex.org/W2072015757","https://openalex.org/W2109330224","https://openalex.org/W2278286793","https://openalex.org/W3001104546","https://openalex.org/W3167715268","https://openalex.org/W3193792594","https://openalex.org/W3200817746","https://openalex.org/W4210631930","https://openalex.org/W4235789583","https://openalex.org/W4316652263","https://openalex.org/W4316652350"],"related_works":["https://openalex.org/W4376639521","https://openalex.org/W2165420145","https://openalex.org/W1534072310","https://openalex.org/W189995875","https://openalex.org/W2103946119","https://openalex.org/W2019306084","https://openalex.org/W1965255372","https://openalex.org/W2118860231","https://openalex.org/W2028468530","https://openalex.org/W2419219947"],"abstract_inverted_index":{"We":[0],"study":[1],"sublinear":[2],"time":[3],"algorithms":[4],"for":[5],"estimating":[6],"the":[7,18,27,47,58],"size":[8],"of":[9,16,38],"maximum":[10],"matching.":[11],"After":[12],"a":[13],"long":[14],"line":[15],"research,":[17],"problem":[19],"was":[20],"finally":[21],"settled":[22],"by":[23],"Behnezhad":[24,42],"\u200d[FOCS\u201922],":[25],"in":[26,72],"regime":[28],"where":[29],"one":[30],"is":[31,70],"willing":[32],"to":[33,50],"pay":[34],"an":[35],"approximation":[36,48],"factor":[37,49,59],"2.":[39],"Very":[40],"recently,":[41],"et":[43],"al.":[44],"\u200d[SODA\u201923]":[45],"improved":[46],"(2\u22121/2O(1/\u03b3))":[51],"using":[52],"n1+\u03b3":[53],"time.":[54,74],"This":[55],"improvement":[56],"over":[57],"2":[60],"is,":[61],"however,":[62],"minuscule":[63],"and":[64],"they":[65],"asked":[66],"if":[67],"even":[68],"1.99-approximation":[69],"possible":[71],"n2\u2212\u03a9(1)":[73]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2023-05-17T00:00:00"}