{"id":"https://openalex.org/W4412480926","doi":"https://doi.org/10.1145/3694906.3743312","title":"A framework for boosting matching approximation: parallel, distributed, and dynamic","display_name":"A framework for boosting matching approximation: parallel, distributed, and dynamic","publication_year":2025,"publication_date":"2025-07-16","ids":{"openalex":"https://openalex.org/W4412480926","doi":"https://doi.org/10.1145/3694906.3743312"},"language":"en","primary_location":{"id":"doi:10.1145/3694906.3743312","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743312","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743312","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743312","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5119008156","display_name":"Slobodan Mitrovi\u0107","orcid":null},"institutions":[{"id":"https://openalex.org/I170726198","display_name":"University of Novi Sad","ror":"https://ror.org/00xa57a59","country_code":"RS","type":"education","lineage":["https://openalex.org/I170726198"]}],"countries":["RS"],"is_corresponding":true,"raw_author_name":"Slobodan Mitrovi\u0107","raw_affiliation_strings":["UC Davis, Davis, USA, University of Novi Sad, Novi Sad, Serbia"],"raw_orcid":"https://orcid.org/0009-0003-9269-4379","affiliations":[{"raw_affiliation_string":"UC Davis, Davis, USA, University of Novi Sad, Novi Sad, Serbia","institution_ids":["https://openalex.org/I170726198"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5092873257","display_name":"Wen-Horng Sheu","orcid":"https://orcid.org/0000-0002-2707-8612"},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Wen-Horng Sheu","raw_affiliation_strings":["UC Davis, Davis, USA"],"raw_orcid":"https://orcid.org/0000-0002-2707-8612","affiliations":[{"raw_affiliation_string":"UC Davis, Davis, USA","institution_ids":["https://openalex.org/I84218800"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5119008156"],"corresponding_institution_ids":["https://openalex.org/I170726198"],"apc_list":null,"apc_paid":null,"fwci":1.3257,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.83762906,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"443","last_page":"457"},"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.9995999932289124,"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.9995999932289124,"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.9995999932289124,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/boosting","display_name":"Boosting (machine learning)","score":0.8821614980697632},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6948003768920898},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.606177031993866},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.42049920558929443},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4090953767299652},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3475853502750397},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2974624037742615},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15650030970573425}],"concepts":[{"id":"https://openalex.org/C46686674","wikidata":"https://www.wikidata.org/wiki/Q466303","display_name":"Boosting (machine learning)","level":2,"score":0.8821614980697632},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6948003768920898},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.606177031993866},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.42049920558929443},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4090953767299652},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3475853502750397},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2974624037742615},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15650030970573425},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3694906.3743312","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743312","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743312","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3694906.3743312","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743312","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743312","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G289180251","display_name":"CAREER: Fast Scalable Graph Algorithms","funder_award_id":"2340048","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"},{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4412480926.pdf","grobid_xml":"https://content.openalex.org/works/W4412480926.grobid-xml"},"referenced_works_count":68,"referenced_works":["https://openalex.org/W1503698146","https://openalex.org/W1514707655","https://openalex.org/W1558472444","https://openalex.org/W1595640791","https://openalex.org/W1967311985","https://openalex.org/W1983248819","https://openalex.org/W2003813631","https://openalex.org/W2047281923","https://openalex.org/W2051586153","https://openalex.org/W2054420170","https://openalex.org/W2153715991","https://openalex.org/W2153977620","https://openalex.org/W2165753192","https://openalex.org/W2173213060","https://openalex.org/W2186715137","https://openalex.org/W2285643850","https://openalex.org/W2310290370","https://openalex.org/W2734687249","https://openalex.org/W2738712979","https://openalex.org/W2748046883","https://openalex.org/W2767578875","https://openalex.org/W2788015272","https://openalex.org/W2809499769","https://openalex.org/W2889287172","https://openalex.org/W2889345925","https://openalex.org/W2896802580","https://openalex.org/W2949572027","https://openalex.org/W2951940772","https://openalex.org/W2952627548","https://openalex.org/W2963298291","https://openalex.org/W2963813153","https://openalex.org/W2971407628","https://openalex.org/W2972260066","https://openalex.org/W2998414467","https://openalex.org/W3001104546","https://openalex.org/W3095269607","https://openalex.org/W3114238887","https://openalex.org/W3127776752","https://openalex.org/W3170971397","https://openalex.org/W3171167615","https://openalex.org/W3186013818","https://openalex.org/W4211172364","https://openalex.org/W4234540089","https://openalex.org/W4241765972","https://openalex.org/W4282006258","https://openalex.org/W4285013187","https://openalex.org/W4285518354","https://openalex.org/W4313203312","https://openalex.org/W4321277255","https://openalex.org/W4376639570","https://openalex.org/W4376639608","https://openalex.org/W4376651355","https://openalex.org/W4377199972","https://openalex.org/W4380874235","https://openalex.org/W4390098007","https://openalex.org/W4390098179","https://openalex.org/W4390098264","https://openalex.org/W4390575704","https://openalex.org/W4402701290","https://openalex.org/W4404848401","https://openalex.org/W4404848912","https://openalex.org/W4404849345","https://openalex.org/W4406143293","https://openalex.org/W4406151889","https://openalex.org/W4406151897","https://openalex.org/W4412480926","https://openalex.org/W6658214496","https://openalex.org/W6746524276"],"related_works":["https://openalex.org/W2125652721","https://openalex.org/W1540371141","https://openalex.org/W1549363203","https://openalex.org/W2147697413","https://openalex.org/W2154063878","https://openalex.org/W4231274751","https://openalex.org/W2556012038","https://openalex.org/W1489772951","https://openalex.org/W1538046993","https://openalex.org/W2571255492"],"abstract_inverted_index":{"This":[0],"work":[1],"designs":[2],"a":[3,19,29,46,52],"framework":[4,17,44],"for":[5,39],"boosting":[6],"the":[7,16,43,63],"approximation":[8,50],"guarantee":[9],"of":[10,51,62,65],"maximum":[11,31,53],"matching":[12,32],"algorithms.":[13],"As":[14],"input,":[15],"receives":[18],"parameter":[20],"\u03f5":[21,49],">":[22],"0":[23],"and":[24],"an":[25],"oracle":[26],"access":[27],"to":[28,67],"\u0398(1)-approximate":[30],"algorithm":[33],"\u0100.":[34],"Then,":[35],"by":[36],"invoking":[37],"\u0100":[38],"poly(1/\u03f5)":[40],"many":[41],"times,":[42],"outputs":[45],"1":[47],"+":[48],"matching.":[54],"Our":[55],"approach":[56],"yields":[57],"several":[58],"improvements":[59],"in":[60],"terms":[61],"number":[64],"invocations":[66],"\u0100:":[68]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}