{"id":"https://openalex.org/W4312108437","doi":"https://doi.org/10.1137/24m1635776","title":"Separating MAX 2-AND, MAX DI-CUT, and MAX CUT","display_name":"Separating MAX 2-AND, MAX DI-CUT, and MAX CUT","publication_year":2026,"publication_date":"2026-05-28","ids":{"openalex":"https://openalex.org/W4312108437","doi":"https://doi.org/10.1137/24m1635776"},"language":"en","primary_location":{"id":"doi:10.1137/24m1635776","is_oa":false,"landing_page_url":"https://doi.org/10.1137/24m1635776","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2212.11191","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028220417","display_name":"Joshua Brakensiek","orcid":"https://orcid.org/0000-0003-4149-7298"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joshua Brakensiek","raw_affiliation_strings":["Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA 94720 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA 94720 USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101768537","display_name":"Neng Huang","orcid":"https://orcid.org/0000-0002-5669-2646"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Neng Huang","raw_affiliation_strings":["Computer Science and Engineering Division, University of Michigan, Ann Arbor, MI 48109 USA"],"raw_orcid":"https://orcid.org/0000-0002-5669-2646","affiliations":[{"raw_affiliation_string":"Computer Science and Engineering Division, University of Michigan, Ann Arbor, MI 48109 USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053469573","display_name":"Aaron Potechin","orcid":"https://orcid.org/0009-0008-8205-1608"},"institutions":[{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aaron Potechin","raw_affiliation_strings":["Department of Computer Science, University of Chicago, Chicago, IL 60637 USA"],"raw_orcid":"https://orcid.org/0009-0008-8205-1608","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Chicago, Chicago, IL 60637 USA","institution_ids":["https://openalex.org/I40347166"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005525211","display_name":"Uri Zwick","orcid":"https://orcid.org/0000-0002-7638-7710"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Uri Zwick","raw_affiliation_strings":["Blavatnik School of Computer Science, Tel Aviv University, Tel Aviv, Israel"],"raw_orcid":"https://orcid.org/0000-0002-7638-7710","affiliations":[{"raw_affiliation_string":"Blavatnik School of Computer Science, Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00375529,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"55","issue":"3","first_page":"FOCS23","last_page":"268"},"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.9976999759674072,"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.9976999759674072,"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.9854999780654907,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9332000017166138,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.8512078523635864},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7913509607315063},{"id":"https://openalex.org/keywords/cut-off","display_name":"Cut-off","score":0.6604585647583008},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6269654035568237},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5824476480484009},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.45626237988471985},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.4533790946006775},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45296573638916016},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3223426342010498},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.18074390292167664},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.12388995289802551}],"concepts":[{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.8512078523635864},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7913509607315063},{"id":"https://openalex.org/C2778462145","wikidata":"https://www.wikidata.org/wiki/Q5196598","display_name":"Cut-off","level":3,"score":0.6604585647583008},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6269654035568237},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5824476480484009},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.45626237988471985},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.4533790946006775},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45296573638916016},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3223426342010498},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.18074390292167664},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.12388995289802551},{"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/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/24m1635776","is_oa":false,"landing_page_url":"https://doi.org/10.1137/24m1635776","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2212.11191","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2212.11191","pdf_url":"https://arxiv.org/pdf/2212.11191","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"","raw_type":"text"},{"id":"doi:10.48550/arxiv.2212.11191","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2212.11191","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"pmh:oai:arXiv.org:2212.11191","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2212.11191","pdf_url":"https://arxiv.org/pdf/2212.11191","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2485349017","display_name":null,"funder_award_id":"CCF-2008920","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"},{"id":"https://openalex.org/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4312108437.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2142835653","https://openalex.org/W2942946217","https://openalex.org/W2903538031","https://openalex.org/W141475505","https://openalex.org/W4245408571","https://openalex.org/W1588356204","https://openalex.org/W2129497110","https://openalex.org/W1519184063","https://openalex.org/W4250100115","https://openalex.org/W2587918"],"abstract_inverted_index":{"Abstract.":[0],"Assuming":[1],"the":[2,7,19,29,47,62,101,156,168,195,236,251,254,309,329],"unique":[3],"games":[4],"conjecture":[5],"(UGC),":[6],"best":[8,40,102],"approximation":[9,32,41,103,238,311],"ratio":[10,56,104],"that":[11,92,105,122,221,227,279],"can":[12,68,106],"be":[13,69,107,126],"obtained":[14,27,108],"in":[15,51,109,162],"polynomial":[16,110],"time":[17,111],"for":[18,43,82,89,112,273,328],"max":[20,44,48,66,74,83,113,123,131,135,138,153,157,189,212,217,228,233,245,257,261,264,274,287,301,304],"cut":[21,49,139,218],"problem":[22,50,161],"is":[23,100,155,166,193,289,331],"[Formula:":[24,93,97,158,170,174,178,197,201,205,213,222,229,258,275,280,305],"see":[25,94,98,159,171,175,179,198,202,206,214,223,230,259,276,281,306],"text],":[26,95,172],"by":[28,145,219],"celebrated":[30],"SDP-based":[31],"algorithm":[33,42,81],"of":[34,57,64,152,167,194,253,317],"Goemans":[35],"and":[36,85,140,147,177,204,225,232,263,303],"Williamson.":[37],"The":[38,296],"current":[39],"di-cut,":[45,262],"i.e.,":[46,183,308],"directed":[52],"graphs,":[53],"achieves":[54],"a":[55,78,86,142,269,292],"about":[58],"0.87401,":[59],"leaving":[60],"open":[61],"question":[63,143],"whether":[65],"di-cut":[67,84,114,124,136,154,190,234,246,288,302],"approximated":[70,127],"as":[71,73,128,130],"well":[72,129],"cut.":[75,265],"We":[76,266],"obtain":[77,268],"slightly":[79],"improved":[80],"new":[87,118,241,270,297,310],"UGC-hardness":[88],"it,":[90],"showing":[91,220,278],"where":[96,173,200],"text]":[99,176,180,199,203,207,224],"under":[115],"UGC.":[116],"Our":[117,240,283],"upper":[119,284],"bound":[120,243,272,285],"shows":[121],"cannot":[125],"cut,":[132],"which":[133,163,320],"separates":[134],"from":[137,216],"resolves":[141],"raised":[144],"Feige":[146],"Goemans.":[148],"A":[149],"natural":[150],"generalization":[151],"text]-and":[160,215,231],"each":[164,191],"constraint":[165,192],"form":[169,196],"are":[181,208,321],"literals,":[182],"variables":[184],"or":[185],"their":[186],"negations":[187],"(in":[188],"variables).":[209],"Austrin":[210],"separated":[211],"conjectured":[226],"have":[235],"same":[237],"ratio.":[239],"lower":[242,271,298],"on":[244,286,300],"refutes":[247],"this":[248],"conjecture,":[249],"completing":[250],"separation":[252],"three":[255],"problems":[256],"text]-and,":[260,277,307],"also":[267],"text].":[282],"achieved":[290],"via":[291,324],"simple,":[293],"analytical":[294],"proof.":[295],"bounds":[299],"algorithms,":[312],"use":[313],"experimentally":[314],"discovered":[315],"distributions":[316],"rounding":[318],"functions":[319],"then":[322],"verified":[323],"computer-assisted":[325],"proofs.":[326],"Code":[327],"project":[330],"available":[332],"at":[333],"https://github.com/jbrakensiek/max-dicut":[334],".":[335]},"counts_by_year":[],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}