{"id":"https://openalex.org/W7141118110","doi":"https://doi.org/10.48550/arxiv.2603.25368","title":"The Complexity of Distributed Minimum Weight Cycle Approximation","display_name":"The Complexity of Distributed Minimum Weight Cycle Approximation","publication_year":2026,"publication_date":"2026-03-26","ids":{"openalex":"https://openalex.org/W7141118110","doi":"https://doi.org/10.48550/arxiv.2603.25368"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.25368","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.25368","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.25368","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102354453","display_name":"Yi Jun Chang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chang, Yi-Jun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5130738611","display_name":"Yanyu Chen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Yanyu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070239198","display_name":"Dipan Dey","orcid":"https://orcid.org/0009-0001-0675-8790"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dey, Dipan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5130794021","display_name":"Yonggang Jiang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jiang, Yonggang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020352999","display_name":"Gopinath Mishra","orcid":"https://orcid.org/0000-0003-0540-0292"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mishra, Gopinath","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085331055","display_name":"Hung Thuan Nguyen","orcid":"https://orcid.org/0009-0006-7993-2952"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nguyen, Hung Thuan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5010160779","display_name":"Mingyang Yang","orcid":"https://orcid.org/0009-0006-8971-2064"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yang, Mingyang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9520999789237976,"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.9520999789237976,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.013500000350177288,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.011300000362098217,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6787999868392944},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.6010000109672546},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4278999865055084},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4189999997615814},{"id":"https://openalex.org/keywords/girth","display_name":"Girth (graph theory)","score":0.38960000872612},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.3869999945163727},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.3862000107765198}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.760699987411499},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7426999807357788},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6787999868392944},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.6010000109672546},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44830000400543213},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4278999865055084},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4189999997615814},{"id":"https://openalex.org/C2777434295","wikidata":"https://www.wikidata.org/wiki/Q959831","display_name":"Girth (graph theory)","level":2,"score":0.38960000872612},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3869999945163727},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.3862000107765198},{"id":"https://openalex.org/C26752605","wikidata":"https://www.wikidata.org/wiki/Q16766188","display_name":"Cycle basis","level":5,"score":0.3531999886035919},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.35010001063346863},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.3440000116825104},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.33180001378059387},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.32409998774528503},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.30489999055862427},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3025999963283539},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30169999599456787},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.2542000114917755}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.25368","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.25368","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.25368","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.25368","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,9,47,54,58,74,78,154,170,174],"Minimum":[3],"Weight":[4],"Cycle":[5],"(MWC)":[6],"problem":[7],"in":[8,37,191,204],"$\\mathsf{CONGEST}$":[10],"model":[11],"of":[12,49,57,122,153,157,164,173,176],"distributed":[13],"computing.":[14],"For":[15],"undirected":[16,116,139,188,208],"weighted":[17,117,140,189,209],"graphs,":[18,118],"we":[19,82],"give":[20],"a":[21,64,149,184],"randomized":[22,96],"$(k+1)$-approximation":[23],"algorithm":[24,35,98,186],"for":[25,85,99,110,127,138,187,200],"every":[26,86,92,128],"\\underline{real":[27],"number}":[28],"$k":[29,88,130],"\\geq":[30,89,131],"(1+\\sqrt{5})/2":[31],"\\approx":[32],"1.618$.":[33],"The":[34,106],"runs":[36],"\\[":[38,102],"\\tilde{O}\\left(n^{\\frac{k+1}{2k+1}}":[39],"+":[40],"D\\right)":[41],"\\]":[42,104],"rounds,":[43,193],"where":[44],"$n$":[45],"is":[46,53],"number":[48],"nodes":[50],"and":[51,70,91,115,135,178,194,207],"$D$":[52],"unweighted":[55,113,206],"diameter":[56,123],"graph.":[59],"Varying":[60],"$k$":[61],"therefore":[62],"yields":[63],"smooth":[65],"trade-off":[66],"between":[67],"approximation":[68,165,202],"ratio":[69],"round":[71,155],"complexity.":[72],"On":[73],"lower-bound":[75],"side,":[76],"assuming":[77],"Erd\u0151s":[79],"girth":[80],"conjecture,":[81],"prove":[83],"that":[84],"\\underline{integer}":[87],"1$":[90],"$\u03b5>":[93],"0$,":[94],"any":[95],"$(k+1-\u03b5)$-approximation":[97],"MWC":[100,159],"requires":[101],"\\tilde\u03a9\\left(n^{\\frac{k+1}{2k+1}}+D\\right)":[103],"rounds.":[105],"lower":[107,136,198],"bound":[108,199],"holds":[109],"both":[111],"directed":[112,205],"graphs":[114,121,141,190],"even":[119],"on":[120],"$\u0398(\\log":[124],"n)$.":[125],"Consequently,":[126],"integer":[129],"2$,":[132],"our":[133],"upper":[134],"bounds":[137],"match":[142],"up":[143],"to":[144],"polylogarithmic":[145],"factors.":[146],"This":[147],"gives":[148],"nearly":[150],"tight":[151],"characterization":[152],"complexity":[156],"approximate":[158],"across":[160],"an":[161,196],"infinite":[162],"family":[163],"ratios.":[166],"These":[167],"results":[168],"improve":[169],"previous":[171],"state":[172],"art":[175],"Manoharan":[177],"Ramachandran":[179],"(PODC":[180],"2024),":[181],"who":[182],"gave":[183],"$(2+\u03b5)$-approximation":[185],"$\\tilde{O}(n^{2/3}+D)$":[192],"proved":[195],"$\\tilde\u03a9(\\sqrt{n})$":[197],"arbitrary":[201],"ratios":[203],"graphs.":[210]},"counts_by_year":[],"updated_date":"2026-07-18T05:51:51.687321","created_date":"2026-03-28T00:00:00"}