{"id":"https://openalex.org/W4286501294","doi":"https://doi.org/10.1145/3519270.3538423","title":"Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions","display_name":"Narrowing the LOCAL-CONGEST Gaps in Sparse Networks via Expander Decompositions","publication_year":2022,"publication_date":"2022-07-20","ids":{"openalex":"https://openalex.org/W4286501294","doi":"https://doi.org/10.1145/3519270.3538423"},"language":"en","primary_location":{"id":"doi:10.1145/3519270.3538423","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519270.3538423","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519270.3538423","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 2022 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/3519270.3538423","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061847213","display_name":"Yi\u2010Jun Chang","orcid":"https://orcid.org/0000-0002-0109-2432"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"Yi-Jun Chang","raw_affiliation_strings":["National University of Singapore, Singapore, Singapore"],"affiliations":[{"raw_affiliation_string":"National University of Singapore, Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]}]},{"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, USA"],"affiliations":[{"raw_affiliation_string":"Boston College, Chestnut Hill, MA, USA","institution_ids":["https://openalex.org/I103531236"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5061847213"],"corresponding_institution_ids":["https://openalex.org/I165932596"],"apc_list":null,"apc_paid":null,"fwci":0.4526,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.65432458,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"301","last_page":"312"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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/computer-science","display_name":"Computer science","score":0.7246598601341248},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6824454069137573},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5316807627677917},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.42042553424835205},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38392210006713867},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35592159628868103},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3468635678291321},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2502487301826477}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7246598601341248},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6824454069137573},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5316807627677917},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.42042553424835205},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38392210006713867},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35592159628868103},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3468635678291321},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2502487301826477},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3519270.3538423","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519270.3538423","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519270.3538423","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 2022 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3519270.3538423","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3519270.3538423","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3519270.3538423","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 2022 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G201645195","display_name":null,"funder_award_id":"CCF-2008422","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"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/W4286501294.pdf","grobid_xml":"https://content.openalex.org/works/W4286501294.grobid-xml"},"referenced_works_count":65,"referenced_works":["https://openalex.org/W168739660","https://openalex.org/W1560551754","https://openalex.org/W1565291260","https://openalex.org/W1601412462","https://openalex.org/W1869515244","https://openalex.org/W1979561519","https://openalex.org/W2019404063","https://openalex.org/W2022155283","https://openalex.org/W2034331023","https://openalex.org/W2035836267","https://openalex.org/W2042899161","https://openalex.org/W2047281923","https://openalex.org/W2049142782","https://openalex.org/W2049413646","https://openalex.org/W2055140109","https://openalex.org/W2067016370","https://openalex.org/W2078400655","https://openalex.org/W2083410501","https://openalex.org/W2106285343","https://openalex.org/W2146081992","https://openalex.org/W2151438396","https://openalex.org/W2165432920","https://openalex.org/W2170616854","https://openalex.org/W2188455456","https://openalex.org/W2242403914","https://openalex.org/W2275325805","https://openalex.org/W2484918492","https://openalex.org/W2488232363","https://openalex.org/W2493557058","https://openalex.org/W2515165863","https://openalex.org/W2552279664","https://openalex.org/W2737872496","https://openalex.org/W2738712979","https://openalex.org/W2789477538","https://openalex.org/W2793058913","https://openalex.org/W2914959486","https://openalex.org/W2937529321","https://openalex.org/W2944960889","https://openalex.org/W2962939270","https://openalex.org/W2962991864","https://openalex.org/W2963662927","https://openalex.org/W2963840696","https://openalex.org/W2963948964","https://openalex.org/W2963962070","https://openalex.org/W2963972775","https://openalex.org/W2964264613","https://openalex.org/W2970822208","https://openalex.org/W2972260066","https://openalex.org/W2998224451","https://openalex.org/W3034790637","https://openalex.org/W3043405145","https://openalex.org/W3046349810","https://openalex.org/W3046877780","https://openalex.org/W3099883947","https://openalex.org/W3102961801","https://openalex.org/W3104014862","https://openalex.org/W3114868980","https://openalex.org/W3117607498","https://openalex.org/W3127810600","https://openalex.org/W3128057791","https://openalex.org/W3160071378","https://openalex.org/W3183249470","https://openalex.org/W3187061951","https://openalex.org/W3187834769","https://openalex.org/W4254419859"],"related_works":["https://openalex.org/W2951991516","https://openalex.org/W4299125676","https://openalex.org/W2727258341","https://openalex.org/W4299556280","https://openalex.org/W2963414285","https://openalex.org/W2372768926","https://openalex.org/W2951106886","https://openalex.org/W4300553673","https://openalex.org/W172120053","https://openalex.org/W4226436121"],"abstract_inverted_index":{"Many":[0],"combinatorial":[1],"optimization":[2],"problems,":[3],"including":[4],"maximum":[5,9,92],"weighted":[6,93],"matching":[7,80,94],"and":[8,34],"independent":[10],"set,":[11],"can":[12,95],"be":[13,64,96],"approximated":[14],"within":[15],"(1":[16],"\u00b1":[17],"\u03b5)":[18],"factors":[19],"in":[20,25,98,103],"poly(log":[21,99],"n,":[22,100],"1/\u03b5)":[23,101],"rounds":[24,102],"the":[26,53,60,71,78,104],"LOCAL":[27],"model":[28],"via":[29],"network":[30],"decompositions":[31],"[Ghaffari,":[32],"Kuhn,":[33],"Maus,":[35],"STOC":[36],"2018].":[37],"These":[38],"approaches,":[39],"however,":[40],"require":[41],"sending":[42],"messages":[43],"of":[44,74],"unlimited":[45],"size,":[46],"so":[47],"they":[48],"do":[49],"not":[50],"extend":[51],"to":[52,63,77],"more":[54],"realistic":[55],"CONGEST":[56,105],"model,":[57],"which":[58],"restricts":[59],"message":[61],"size":[62],"O(log":[65],"n)":[66],"bits.":[67],"For":[68],"example,":[69],"despite":[70],"long":[72],"line":[73],"research":[75],"devoted":[76],"distributed":[79],"problem,":[81],"it":[82],"still":[83],"remains":[84],"a":[85],"major":[86],"open":[87],"problem":[88],"whether":[89],"an":[90],"(1-\u03b5)-approximate":[91],"computed":[97],"model.":[106]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":3}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}