{"id":"https://openalex.org/W3015540189","doi":"https://doi.org/10.1137/21m1439390","title":"Approximating Min-Mean-Cycle for Low-Diameter Graphs in Near-Optimal Time and Memory","display_name":"Approximating Min-Mean-Cycle for Low-Diameter Graphs in Near-Optimal Time and Memory","publication_year":2022,"publication_date":"2022-08-01","ids":{"openalex":"https://openalex.org/W3015540189","doi":"https://doi.org/10.1137/21m1439390","mag":"3015540189"},"language":"en","primary_location":{"id":"doi:10.1137/21m1439390","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21m1439390","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2004.03114","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039466187","display_name":"Jason M. Altschuler","orcid":"https://orcid.org/0000-0001-7367-0097"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jason M. Altschuler","raw_affiliation_strings":["LIDS), Massachusetts Institute of Technology, Cambridge MA 02139"],"affiliations":[{"raw_affiliation_string":"LIDS), Massachusetts Institute of Technology, Cambridge MA 02139","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031935416","display_name":"Pablo A. Parrilo","orcid":"https://orcid.org/0000-0003-1132-8477"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pablo A. Parrilo","raw_affiliation_strings":["LIDS), Massachusetts Institute of Technology, Cambridge MA 02139"],"affiliations":[{"raw_affiliation_string":"LIDS), Massachusetts Institute of Technology, Cambridge MA 02139","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5039466187"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":0.6012,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.68029101,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"32","issue":"3","first_page":"1791","last_page":"1816"},"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.9986000061035156,"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.9986000061035156,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7418132424354553},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5099173784255981},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.48237505555152893},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4676954746246338},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.448687881231308},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.44669482111930847},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4347725212574005},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42304179072380066},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4082641005516052},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39589276909828186}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7418132424354553},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5099173784255981},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48237505555152893},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4676954746246338},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.448687881231308},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.44669482111930847},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4347725212574005},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42304179072380066},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4082641005516052},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39589276909828186},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/21m1439390","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21m1439390","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2004.03114","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2004.03114","pdf_url":"https://arxiv.org/pdf/2004.03114","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2004.03114","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2004.03114","pdf_url":"https://arxiv.org/pdf/2004.03114","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3526151021","display_name":null,"funder_award_id":"1122374","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4723251218","display_name":null,"funder_award_id":"1565235","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5635854791","display_name":null,"funder_award_id":"112237","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6894402473","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7297461854","display_name":null,"funder_award_id":"122374","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7384773580","display_name":null,"funder_award_id":"AF 1565235","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":68,"referenced_works":["https://openalex.org/W114286715","https://openalex.org/W202070310","https://openalex.org/W341186930","https://openalex.org/W342309696","https://openalex.org/W630231741","https://openalex.org/W1509653541","https://openalex.org/W1677133548","https://openalex.org/W1969357318","https://openalex.org/W1969625919","https://openalex.org/W1982095877","https://openalex.org/W1983093080","https://openalex.org/W1985077192","https://openalex.org/W1988067232","https://openalex.org/W1991466857","https://openalex.org/W1993677524","https://openalex.org/W1999406555","https://openalex.org/W2002792327","https://openalex.org/W2021936731","https://openalex.org/W2022242474","https://openalex.org/W2026128612","https://openalex.org/W2028145673","https://openalex.org/W2036772106","https://openalex.org/W2042321516","https://openalex.org/W2048790997","https://openalex.org/W2048881187","https://openalex.org/W2063123613","https://openalex.org/W2070461982","https://openalex.org/W2081316950","https://openalex.org/W2090010485","https://openalex.org/W2106299112","https://openalex.org/W2108209095","https://openalex.org/W2110216183","https://openalex.org/W2113147495","https://openalex.org/W2118382442","https://openalex.org/W2136442765","https://openalex.org/W2141470955","https://openalex.org/W2146709340","https://openalex.org/W2158131535","https://openalex.org/W2164141517","https://openalex.org/W2169528473","https://openalex.org/W2294334272","https://openalex.org/W2543566970","https://openalex.org/W2568456731","https://openalex.org/W2620318602","https://openalex.org/W2624960300","https://openalex.org/W2803761918","https://openalex.org/W2897366538","https://openalex.org/W2898066105","https://openalex.org/W2911796152","https://openalex.org/W2946018322","https://openalex.org/W2952266944","https://openalex.org/W2953166082","https://openalex.org/W2962719003","https://openalex.org/W2963326510","https://openalex.org/W2963595145","https://openalex.org/W2988480584","https://openalex.org/W3010731927","https://openalex.org/W3099205471","https://openalex.org/W3105140593","https://openalex.org/W3126680358","https://openalex.org/W3129191225","https://openalex.org/W3138503030","https://openalex.org/W3145128584","https://openalex.org/W3159456488","https://openalex.org/W3181224955","https://openalex.org/W4206471589","https://openalex.org/W4239519089","https://openalex.org/W4246219036"],"related_works":["https://openalex.org/W2185409389","https://openalex.org/W2515987778","https://openalex.org/W4205854323","https://openalex.org/W2020662107","https://openalex.org/W2378280103","https://openalex.org/W1587547334","https://openalex.org/W4244487479","https://openalex.org/W2364907623","https://openalex.org/W2148488562","https://openalex.org/W2626810543"],"abstract_inverted_index":{"We":[0,38,136],"revisit":[1],"Min-Mean-Cycle,":[2],"the":[3,33,69,76,84,89,98,119,127,139,147,159,180],"classical":[4,148],"problem":[5],"of":[6,35,60,78,130,146,161],"finding":[7],"a":[8,11,29,109,122,144,167],"cycle":[9],"in":[10,32,75,166,183],"weighted":[12],"directed":[13],"graph":[14],"with":[15,42,55,179],"minimum":[16],"mean":[17],"weight.":[18],"Despite":[19],"an":[20,40,49],"extensive":[21],"algorithmic":[22],"literature,":[23],"previous":[24],"work":[25],"failed":[26],"to":[27,121,133,155,174],"achieve":[28],"near-linear":[30,43,156],"runtime":[31,44,73,157],"number":[34,77],"edges":[36],"$m$.":[37],"propose":[39],"algorithm":[41,71,91,150,171],"$\\tilde{O}(m":[45],"(W_{\\max}/\\epsilon)^2)$":[46],"for":[47,83],"computing":[48],"$\\epsilon$":[50],"additive":[51],"approximation":[52],"on":[53,88,107],"graphs":[54],"polylogarithmic":[56],"diameter":[57],"and":[58,164,176],"weights":[59],"magnitude":[61],"at":[62,158],"most":[63],"$W_{\\max}$.":[64],"In":[65],"particular,":[66],"this":[67],"is":[68,105,152,172,177],"first":[70],"whose":[72],"scales":[74],"vertices":[79],"$n$":[80],"as":[81],"$\\tilde{O}(n^2)$":[82],"complete":[85],"graph.":[86],"Moreover---unconditionally":[87],"diameter---the":[90],"uses":[92],"only":[93],"$O(n)$":[94],"memory":[95],"beyond":[96],"reading":[97],"input,":[99],"making":[100],"it":[101],"\u201cmemory-optimal\".":[102],"Our":[103],"approach":[104],"based":[106],"solving":[108],"linear":[110],"programming":[111],"(LP)":[112],"relaxation":[113],"using":[114,143],"entropic":[115],"regularization,":[116],"which":[117],"reduces":[118],"LP":[120,141],"Matrix":[123,134],"Balancing":[124],"problem---\u00e0":[125],"la":[126],"popular":[128],"reduction":[129],"Optimal":[131],"Transport":[132],"Scaling.":[135],"then":[137],"round":[138],"fractional":[140],"solution":[142],"variant":[145],"Cycle-Canceling":[149],"that":[151],"sped":[153],"up":[154],"expense":[160],"being":[162],"approximate,":[163],"implemented":[165],"memory-optimal":[168],"manner.":[169],"The":[170],"simple":[173],"implement":[175],"competitive":[178],"state-of-the-art":[181],"methods":[182],"practice.":[184]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2020-04-17T00:00:00"}