{"id":"https://openalex.org/W4380874235","doi":"https://doi.org/10.1145/3583668.3594570","title":"(1- <i>\u03f5</i> )-Approximate Maximum Weighted Matching in poly(1/ <i>\u03f5</i> , log <i>n</i> ) Time in the Distributed and Parallel Settings","display_name":"(1- <i>\u03f5</i> )-Approximate Maximum Weighted Matching in poly(1/ <i>\u03f5</i> , log <i>n</i> ) Time in the Distributed and Parallel Settings","publication_year":2023,"publication_date":"2023-06-16","ids":{"openalex":"https://openalex.org/W4380874235","doi":"https://doi.org/10.1145/3583668.3594570"},"language":"en","primary_location":{"id":"doi:10.1145/3583668.3594570","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3583668.3594570","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3583668.3594570","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 2023 ACM Symposium on Principles of Distributed Computing","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/3583668.3594570","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086319053","display_name":"Shang-En Huang","orcid":"https://orcid.org/0000-0002-9799-0981"},"institutions":[{"id":"https://openalex.org/I103531236","display_name":"Boston College","ror":"https://ror.org/02n2fzt79","country_code":"US","type":"education","lineage":["https://openalex.org/I103531236"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Shang-En Huang","raw_affiliation_strings":["Boston College, Chestnut Hill, MA, USA"],"raw_orcid":"https://orcid.org/0000-0002-9799-0981","affiliations":[{"raw_affiliation_string":"Boston College, Chestnut Hill, MA, USA","institution_ids":["https://openalex.org/I103531236"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005437771","display_name":"Hsin-Hao Su","orcid":"https://orcid.org/0009-0002-7970-9604"},"institutions":[{"id":"https://openalex.org/I103531236","display_name":"Boston College","ror":"https://ror.org/02n2fzt79","country_code":"US","type":"education","lineage":["https://openalex.org/I103531236"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hsin-Hao Su","raw_affiliation_strings":["Boston College, Chestnut Hill, MA, United States"],"raw_orcid":"https://orcid.org/0009-0002-7970-9604","affiliations":[{"raw_affiliation_string":"Boston College, Chestnut Hill, MA, United States","institution_ids":["https://openalex.org/I103531236"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086319053"],"corresponding_institution_ids":["https://openalex.org/I103531236"],"apc_list":null,"apc_paid":null,"fwci":1.1639,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.81352894,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"44","last_page":"54"},"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/T10237","display_name":"Cryptography and Data Security","score":0.9972000122070312,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9970999956130981,"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/bipartite-graph","display_name":"Bipartite graph","score":0.7712716460227966},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6160523891448975},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6022635698318481},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5386682748794556},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5146854519844055},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5005989074707031},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4969189465045929},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.44156742095947266},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.41577470302581787},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39239776134490967},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3604591488838196},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.34891700744628906},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33745449781417847}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7712716460227966},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6160523891448975},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6022635698318481},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5386682748794556},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5146854519844055},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5005989074707031},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4969189465045929},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.44156742095947266},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.41577470302581787},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39239776134490967},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3604591488838196},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34891700744628906},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33745449781417847},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3583668.3594570","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3583668.3594570","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3583668.3594570","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 2023 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3583668.3594570","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3583668.3594570","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3583668.3594570","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 2023 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7995651076","display_name":"AF: Small: Combinatorial Optimization Problems in Vertex Centric Computation","funder_award_id":"2008422","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/W4380874235.pdf","grobid_xml":"https://content.openalex.org/works/W4380874235.grobid-xml"},"referenced_works_count":29,"referenced_works":["https://openalex.org/W1497938971","https://openalex.org/W1499313444","https://openalex.org/W1523785148","https://openalex.org/W1569649260","https://openalex.org/W1957963525","https://openalex.org/W1964089073","https://openalex.org/W1964932074","https://openalex.org/W1967311985","https://openalex.org/W1983248819","https://openalex.org/W1993913882","https://openalex.org/W2011595776","https://openalex.org/W2014533003","https://openalex.org/W2024607148","https://openalex.org/W2039562302","https://openalex.org/W2047281923","https://openalex.org/W2064306958","https://openalex.org/W2083323175","https://openalex.org/W2083410501","https://openalex.org/W2091299439","https://openalex.org/W2100061495","https://openalex.org/W2275325805","https://openalex.org/W2607483562","https://openalex.org/W2738712979","https://openalex.org/W2963298291","https://openalex.org/W2963840696","https://openalex.org/W2972260066","https://openalex.org/W4282006258","https://openalex.org/W4286501294","https://openalex.org/W4313482761"],"related_works":["https://openalex.org/W2151412766","https://openalex.org/W4377371889","https://openalex.org/W2962917430","https://openalex.org/W4389362338","https://openalex.org/W2028468530","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W4299801389"],"abstract_inverted_index":{"The":[0],"maximum":[1,52],"weighted":[2],"matching":[3],"(mwm)":[4],"problem":[5,59,136],"is":[6],"one":[7],"of":[8,30,124,165,184],"the":[9,24,27,75,102,156,163,173,182,213],"most":[10,126],"well-studied":[11],"combinatorial":[12],"optimization":[13],"problems":[14],"in":[15,69,74,108,155,172,212],"distributed":[16],"graph":[17,88],"algorithms.":[18],"Despite":[19],"a":[20,38,45,61,113,139,147,195,209],"long":[21],"development":[22],"on":[23],"problem,":[25],"and":[26,33,95,168,178,181,187,208],"recent":[28],"progress":[29],"Fischer,":[31,166],"Mitrovic,":[32,167],"Uitto":[34,169],"[16]":[35],"who":[36],"gave":[37],"poly(1/\u03f5,":[39,70,141,200],"log":[40,71,142,201],"n)-round":[41,143],"algorithm":[42,144,164,175,198,211],"for":[43,50,86,111,145,152],"obtaining":[44,112],"(1":[46,62,114,148],"\u2212":[47,63,115,149],"\u03f5)-approximate":[48,64,116,150],"solution":[49,117,161,192],"unweighted":[51],"matching,":[53],"it":[54],"had":[55],"been":[56],"an":[57,121],"open":[58,135],"whether":[60],"mwm":[65,151],"can":[66],"be":[67],"obtained":[68],"n)":[72,202],"rounds":[73,110],"CONGEST":[76,157],"model.":[77,158,215],"Algorithms":[78],"with":[79,199],"such":[80,90],"running":[81],"times":[82],"were":[83],"only":[84,205],"known":[85,104],"special":[87],"classes":[89],"as":[91],"bipartite":[92],"graphs":[93,97,154],"[1]":[94],"minor-free":[96],"[8].":[98],"For":[99],"general":[100,153],"graphs,":[101],"previously":[103],"algorithms":[105],"require":[106],"exponential":[107],"(1/\u03f5)":[109],"[13]":[118],"or":[119],"achieve":[120],"approximation":[122],"factor":[123],"at":[125],"2/3":[127],"[1].":[128],"In":[129],"this":[130,134,191],"work,":[131],"we":[132],"settle":[133],"by":[137],"giving":[138],"deterministic":[140],"computing":[146],"Our":[159],"proposed":[160],"extends":[162],"[16],":[170],"blends":[171],"sequential":[174],"from":[176],"Duan":[177],"Pettie":[179],"[11]":[180],"work":[183],"Faour,":[185],"Fuchs,":[186],"Kuhn":[188],"[13].":[189],"Interestingly,":[190],"also":[193],"implies":[194],"CREW":[196],"PRAM":[197],"span":[203],"using":[204],"O(m)":[206],"processors,":[207],"poly(1/\u03f5)-passes":[210],"semi-streaming":[214]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}