{"id":"https://openalex.org/W3185749561","doi":"https://doi.org/10.1145/3454125","title":"Improving the Smoothed Complexity of FLIP for Max Cut Problems","display_name":"Improving the Smoothed Complexity of FLIP for Max Cut Problems","publication_year":2021,"publication_date":"2021-07-15","ids":{"openalex":"https://openalex.org/W3185749561","doi":"https://doi.org/10.1145/3454125","mag":"3185749561"},"language":"en","primary_location":{"id":"doi:10.1145/3454125","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3454125","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3454125","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3454125","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061561940","display_name":"Ali Bibak","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ali Bibak","raw_affiliation_strings":["University of Illinois, Urbana-Champaign"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois, Urbana-Champaign","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001930573","display_name":"Charles Carlson","orcid":null},"institutions":[{"id":"https://openalex.org/I188538660","display_name":"University of Colorado Boulder","ror":"https://ror.org/02ttsq026","country_code":"US","type":"education","lineage":["https://openalex.org/I188538660"]},{"id":"https://openalex.org/I2802236040","display_name":"University of Colorado System","ror":"https://ror.org/00jc20583","country_code":"US","type":"education","lineage":["https://openalex.org/I2802236040"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Charles Carlson","raw_affiliation_strings":["University of Colorado Boulder"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Colorado Boulder","institution_ids":["https://openalex.org/I2802236040","https://openalex.org/I188538660"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011591780","display_name":"Karthekeyan Chandrasekaran","orcid":"https://orcid.org/0000-0002-3421-7238"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Karthekeyan Chandrasekaran","raw_affiliation_strings":["University of Illinois, Urbana-Champaign"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois, Urbana-Champaign","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4567,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.68101098,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"17","issue":"3","first_page":"1","last_page":"38"},"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.9976000189781189,"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.9976000189781189,"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.9904999732971191,"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.9664999842643738,"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.6105650067329407},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6103250980377197},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5898810625076294},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5646325945854187},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4912218451499939},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.48329904675483704},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4555533826351166},{"id":"https://openalex.org/keywords/matrix-completion","display_name":"Matrix completion","score":0.4375714063644409},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.43379828333854675},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4022887051105499},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3424987196922302},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.10760673880577087}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6105650067329407},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6103250980377197},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5898810625076294},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5646325945854187},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4912218451499939},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.48329904675483704},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4555533826351166},{"id":"https://openalex.org/C2778459887","wikidata":"https://www.wikidata.org/wiki/Q6787865","display_name":"Matrix completion","level":3,"score":0.4375714063644409},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.43379828333854675},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4022887051105499},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3424987196922302},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.10760673880577087},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"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/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/3454125","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3454125","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3454125","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3454125","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3454125","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3454125","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7731199567","display_name":null,"funder_award_id":"CCF 18-14613","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":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3185749561.pdf","grobid_xml":"https://content.openalex.org/works/W3185749561.grobid-xml"},"referenced_works_count":7,"referenced_works":["https://openalex.org/W1601503375","https://openalex.org/W2034053794","https://openalex.org/W2062459871","https://openalex.org/W2103981148","https://openalex.org/W2340006107","https://openalex.org/W2403232853","https://openalex.org/W4252350499"],"related_works":["https://openalex.org/W2994409951","https://openalex.org/W2604249670","https://openalex.org/W3144354057","https://openalex.org/W4301205717","https://openalex.org/W4288107728","https://openalex.org/W2788210652","https://openalex.org/W3093503721","https://openalex.org/W3213035342","https://openalex.org/W2972830027","https://openalex.org/W2023710022"],"abstract_inverted_index":{"Finding":[0],"locally":[1,21],"optimal":[2],"solutions":[3],"for":[4,76,97,176,209,229,249,257,285,294],"MAX-CUT":[5],"and":[6,62,86,121,136,212,256],"MAX-":[7],"k":[8,260,288,297],"-CUT":[9],"are":[10,189],"well-known":[11],"PLS-complete":[12],"problems.":[13],"An":[14],"instinctive":[15],"approach":[16],"to":[17,39],"finding":[18],"such":[19],"a":[20,192,226],"optimum":[22],"solution":[23],"is":[24,81,102,112,123,152,181,254,266],"the":[25,49,57,71,92,117,124,129,140,165,171,199,202,233,244],"FLIP":[26,30,52,75,96,175,231,248,284],"method.":[27],"Even":[28],"though":[29],"requires":[31],"exponential":[32],"time":[33],"in":[34,42,56,78,99,128,178,232,251,263,291],"worst-case":[35],"instances,":[36],"it":[37],"tends":[38],"terminate":[40],"quickly":[41],"practical":[43],"instances.":[44],"To":[45],"explain":[46],"this":[47,157,210,219,238],"discrepancy,":[48],"run-time":[50,150,166,200],"of":[51,74,95,126,174,201,247,276,283],"has":[53],"been":[54],"studied":[55],"smoothed":[58,72,93,143,172,234,245,280],"complexity":[59,73,94,173,246,282],"framework.":[60,235],"Etscheid":[61],"R\u00f6glin":[63],"(ACM":[64],"Transactions":[65],"on":[66,116,191,218],"Algorithms,":[67],"2017)":[68,89],"showed":[69,90,139],"that":[70,91,148,170,243,270],"max-cut":[77,98,177],"arbitrary":[79,264],"graphs":[80,101,180,253,265,293],"quasi-polynomial.":[82,267],"Angel,":[83,133],"Bubeck,":[84,134],"Peres,":[85,135],"Wei":[87],"(STOC,":[88],"complete":[100,179,252,292],"(":[103],"O":[104,182],"\u03a6":[105,111,122],"5":[106],"n":[107,184],"15.1":[108],"),":[109],"where":[110],"an":[113,213],"upper":[114],"bound":[115,151,216],"random":[118],"edge-weight":[119],"density":[120],"number":[125],"vertices":[127],"input":[130],"graph.":[131],"While":[132],"Wei\u2019s":[137],"result":[138],"first":[141],"polynomial":[142,255,281],"complexity,":[144],"they":[145],"also":[146,274],"conjectured":[147],"their":[149],"far":[153],"from":[154],"optimal.":[155],"In":[156,221],"work,":[158],"we":[159],"make":[160],"substantial":[161],"progress":[162],"toward":[163,278],"improving":[164],"bound.":[167],"We":[168,236,268],"prove":[169],"(\u03a6":[183],"7.83":[185],").":[186],"Our":[187],"results":[188],"based":[190,217],"carefully":[193],"chosen":[194],"matrix":[195,211],"whose":[196],"rank":[197,207],"captures":[198],"method":[203],"along":[204],"with":[205],"improved":[206,214],"bounds":[208],"union":[215],"matrix.":[220],"addition,":[222],"our":[223,271],"techniques":[224,272],"provide":[225],"general":[227,239],"framework":[228,240],"analyzing":[230],"illustrate":[237],"by":[241],"showing":[242,279],"MAX-3-CUT":[250],"MAX":[258,286],"-":[259,261,287,289],"CUT":[262,290],"believe":[269],"should":[273],"be":[275],"interest":[277],"larger":[295],"constants":[296],".":[298]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}