{"id":"https://openalex.org/W7147555985","doi":"https://doi.org/10.48550/arxiv.2603.28700","title":"Improved Approximation Algorithms for Multiway Cut by Large Mixtures of New and Old Rounding Schemes","display_name":"Improved Approximation Algorithms for Multiway Cut by Large Mixtures of New and Old Rounding Schemes","publication_year":2026,"publication_date":"2026-03-30","ids":{"openalex":"https://openalex.org/W7147555985","doi":"https://doi.org/10.48550/arxiv.2603.28700"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.28700","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.28700","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":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.28700","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":[],"countries":[],"is_corresponding":false,"raw_author_name":"Brakensiek, Joshua","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5132634638","display_name":"Neng Huang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Huang, Neng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053469573","display_name":"Aaron Potechin","orcid":"https://orcid.org/0009-0008-8205-1608"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Potechin, Aaron","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5005525211","display_name":"Uri Zwick","orcid":"https://orcid.org/0000-0002-7638-7710"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zwick, Uri","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.819100022315979,"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.819100022315979,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.10050000250339508,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T12404","display_name":"Mathematical Approximation and Integration","score":0.0284000001847744,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.9366000294685364},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7717999815940857},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5548999905586243},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.508400022983551},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4659000039100647},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.41530001163482666},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.41449999809265137},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3928000032901764}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.9366000294685364},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7717999815940857},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6960999965667725},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.609000027179718},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5548999905586243},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.508400022983551},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4984000027179718},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4659000039100647},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.41530001163482666},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.41449999809265137},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41269999742507935},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3928000032901764},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.3806999921798706},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.33660000562667847},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.3312000036239624},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.3239000141620636},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.32100000977516174},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.3174000084400177},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.29260000586509705},{"id":"https://openalex.org/C61005703","wikidata":"https://www.wikidata.org/wiki/Q2145211","display_name":"Round-off error","level":2,"score":0.28780001401901245},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.262800008058548},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.26269999146461487},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.25999999046325684}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.28700","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.28700","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":"doi:10.48550/arxiv.2603.28700","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.28700","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":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":{"The":[0,20,59,65],"input":[1],"to":[2,23,200],"the":[3,25,28,38,42,47,55,72,116,123,152,171,202,273],"Multiway":[4,166],"Cut":[5],"problem":[6,60,73],"is":[7,22,57,61,141],"a":[8,86,183,187,224,236,245,257,261,278,287],"weighted":[9],"undirected":[10],"graph,":[11],"with":[12,99,260],"nonnegative":[13],"edge":[14],"weights,":[15],"and":[16,80,158,193,197,214,217,292],"$k$":[17,31],"designated":[18],"terminals.":[19],"goal":[21],"partition":[24,56],"vertices":[26,50],"of":[27,37,44,46,54,93,104,110,155,186,226,239,248,250,282,289],"graph":[29],"into":[30],"parts,":[32],"each":[33,234,254],"containing":[34],"exactly":[35],"one":[36],"terminals,":[39],"such":[40],"that":[41],"sum":[43],"weights":[45],"edges":[48],"connecting":[49],"in":[51,119,266],"different":[52,237,269],"parts":[53],"minimized.":[58],"APX-hard":[62],"for":[63,71,74,107],"$k\\ge3$.":[64],"currently":[66,124],"best":[67,125],"known":[68],"approximation":[69,91,102,126,139],"algorithm":[70,98,140,243],"arbitrary":[75],"$k$,":[76],"obtained":[77,128],"by":[78,129,191,208,215,256],"Sharma":[79,216],"Vondr\u00e1k":[81],"[STOC":[82,133,160,212],"2014]":[83],"more":[84],"than":[85],"decade":[87],"ago,":[88],"has":[89],"an":[90,97,100,137],"ratio":[92,103,164],"1.2965.":[94],"We":[95,276],"present":[96],"improved":[101,284],"1.2787.":[105],"Also,":[106],"small":[108],"values":[109],"$k":[111],"\\ge":[112],"4$":[113],"we":[114,181],"obtain":[115],"first":[117],"improvements":[118],"25":[120],"years":[121],"over":[122],"ratios":[127],"Karger":[130],"et":[131,176,210],"al.":[132,211],"1999].":[134],"(For":[135],"$k=3$":[136],"optimal":[138],"known.)":[142],"Our":[143],"main":[144],"technical":[145],"contributions":[146],"are":[147],"new":[148],"insights":[149],"on":[150],"rounding":[151,188,205,232,240,252,270],"LP":[153],"relaxation":[154],"C\u0103linescu,":[156],"Karloff,":[157],"Rabani":[159],"1998],":[161],"whose":[162],"integrality":[163],"matches":[165],"Cut's":[167],"approximability":[168],"ratio,":[169],"assuming":[170],"Unique":[172],"Games":[173],"Conjecture":[174],"[Manokaran":[175],"al.,":[177],"STOC":[178],"2008].":[179],"First,":[180],"introduce":[182],"generalized":[184],"form":[185],"scheme":[189,206],"suggested":[190],"Kleinberg":[192],"Tardos":[194],"[FOCS":[195],"1999]":[196],"use":[198,223],"it":[199],"replace":[201],"Exponential":[203],"Clocks":[204],"used":[207],"Buchbinder":[209],"2013]":[213],"Vondr\u00e1k.":[218],"Second,":[219],"while":[220],"previous":[221],"algorithms":[222,285],"mixture":[225,247],"two,":[227],"three,":[228],"or":[229],"four":[230],"basic":[231,251],"schemes,":[233,241,253],"from":[235,272],"family":[238],"our":[242,283],"uses":[244],"computationally-discovered":[246],"hundreds":[249],"parametrized":[255],"random":[258],"variable":[259],"distinct":[262],"probability":[263],"distribution,":[264],"including":[265],"particular":[267],"many":[268],"schemes":[271],"same":[274],"family.":[275],"give":[277],"completely":[279],"rigorous":[280],"analysis":[281],"using":[286],"combination":[288],"analytical":[290],"techniques":[291],"interval":[293],"arithmetic.":[294]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-04-02T00:00:00"}