{"id":"https://openalex.org/W2536358984","doi":"https://doi.org/10.1145/3055399.3055402","title":"Local max-cut in smoothed polynomial time","display_name":"Local max-cut in smoothed polynomial time","publication_year":2017,"publication_date":"2017-06-15","ids":{"openalex":"https://openalex.org/W2536358984","doi":"https://doi.org/10.1145/3055399.3055402","mag":"2536358984"},"language":"en","primary_location":{"id":"doi:10.1145/3055399.3055402","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3055399.3055402","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067501882","display_name":"Omer Angel","orcid":"https://orcid.org/0000-0002-6451-8242"},"institutions":[{"id":"https://openalex.org/I141945490","display_name":"University of British Columbia","ror":"https://ror.org/03rmrcq20","country_code":"CA","type":"education","lineage":["https://openalex.org/I141945490"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Omer Angel","raw_affiliation_strings":["University of British Columbia, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of British Columbia, Canada","institution_ids":["https://openalex.org/I141945490"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021842384","display_name":"S\u00e9bastien Bubeck","orcid":"https://orcid.org/0000-0001-9122-4410"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S\u00e9bastien Bubeck","raw_affiliation_strings":["Microsoft Research, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020836845","display_name":"Yuval Peres","orcid":"https://orcid.org/0000-0001-5456-6323"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yuval Peres","raw_affiliation_strings":["Microsoft Research, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100911449","display_name":"Fan Wei","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Fan Wei","raw_affiliation_strings":["Stanford University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"429","last_page":"437"},"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.9998999834060669,"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.9998999834060669,"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.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/T12288","display_name":"Optimization and Search Problems","score":0.9990000128746033,"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/mathematical-proof","display_name":"Mathematical proof","score":0.6777148246765137},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6364102363586426},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6206393241882324},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5837540626525879},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.526191771030426},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4899686872959137},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4639984965324402},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38323456048965454},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2453233003616333},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.0923638641834259}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6777148246765137},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6364102363586426},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6206393241882324},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5837540626525879},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.526191771030426},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4899686872959137},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4639984965324402},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38323456048965454},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2453233003616333},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0923638641834259},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3055399.3055402","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3055399.3055402","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1944873932","https://openalex.org/W2103981148","https://openalex.org/W2145297839"],"related_works":["https://openalex.org/W4394650907","https://openalex.org/W4254119641","https://openalex.org/W3196207352","https://openalex.org/W2951724202","https://openalex.org/W3084261076","https://openalex.org/W2576399385","https://openalex.org/W2963408011","https://openalex.org/W4236324517","https://openalex.org/W1586813864","https://openalex.org/W1774334694"],"abstract_inverted_index":{"In":[0,67,114],"1988,":[1],"Johnson,":[2],"Papadimitriou":[3],"and":[4,72],"Yannakakis":[5],"wrote":[6],"that":[7,18,75,127],"\"Practically":[8],"all":[9],"the":[10,32,55,76,109],"empirical":[11,33],"evidence":[12,34],"would":[13],"lead":[14],"us":[15],"to":[16,37],"conclude":[17],"finding":[19,128],"locally":[20],"optimal":[21],"solutions":[22],"is":[23,54,65,82,104,133],"much":[24,134],"easier":[25,135],"than":[26,136],"solving":[27,137],"NP-hard":[28],"problems\".":[29],"Since":[30],"then":[31],"has":[35],"continued":[36],"amass,":[38],"but":[39],"formal":[40],"proofs":[41],"of":[42,79],"this":[43,115],"phenomenon":[44],"have":[45],"remained":[46],"elusive.":[47],"A":[48],"canonical":[49],"(and":[50],"indeed":[51],"complete)":[52],"example":[53],"local":[56,80,93,123,129],"max-cut":[57,81,132],"problem,":[58],"for":[59,122,131],"which":[60],"no":[61],"polynomial":[62,120],"time":[63],"method":[64],"known.":[66],"a":[68,92],"breakthrough":[69],"paper,":[70],"Etscheid":[71],"R\u00f6glin":[73],"proved":[74],"smoothed":[77,119],"complexity":[78,121],"quasi-polynomial,":[83],"i.e.,":[84],"if":[85],"arbitrary":[86],"bounded":[87],"weights":[88],"are":[89],"randomly":[90],"perturbed,":[91],"maximum":[94],"can":[95],"be":[96],"found":[97],"in":[98],"\u03d5":[99,103],"nO(logn)":[100],"steps":[101],"where":[102],"an":[105],"upper":[106],"bound":[107],"on":[108],"random":[110],"edge":[111],"weight":[112],"density.":[113],"paper":[116],"we":[117],"prove":[118],"max-cut,":[124],"thus":[125],"confirming":[126],"optima":[130],"it.":[138]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}