{"id":"https://openalex.org/W3036281379","doi":"https://doi.org/10.1137/19m1299359","title":"LP Relaxation and Tree Packing for Minimum $k$-Cut","display_name":"LP Relaxation and Tree Packing for Minimum $k$-Cut","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3036281379","doi":"https://doi.org/10.1137/19m1299359","mag":"3036281379"},"language":"en","primary_location":{"id":"doi:10.1137/19m1299359","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1299359","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","raw_type":"journal-article"},"type":"article","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/A5036503505","display_name":"Chandra Chekuri","orcid":"https://orcid.org/0000-0003-3035-1699"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chandra Chekuri","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019690129","display_name":"Kent Quanrud","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kent Quanrud","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5081196371","display_name":"Chao Xu","orcid":"https://orcid.org/0000-0003-4417-3299"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chao Xu","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":2.6245,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.91876812,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"34","issue":"2","first_page":"1334","last_page":"1353"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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.9995999932289124,"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.9991999864578247,"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/combinatorics","display_name":"Combinatorics","score":0.7750831842422485},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6876429319381714},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.6413227319717407},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5538898706436157},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5079496502876282},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.4833190441131592},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.4829796850681305},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4715210199356079},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.43902522325515747},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3892306685447693},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.30135461688041687},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27812790870666504}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7750831842422485},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6876429319381714},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6413227319717407},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5538898706436157},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5079496502876282},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4833190441131592},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.4829796850681305},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4715210199356079},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.43902522325515747},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3892306685447693},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.30135461688041687},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27812790870666504},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","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/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.1137/19m1299359","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1299359","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G401424543","display_name":null,"funder_award_id":"CCF-1526799","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":33,"referenced_works":["https://openalex.org/W147723608","https://openalex.org/W1496921672","https://openalex.org/W1519147138","https://openalex.org/W1964510837","https://openalex.org/W1974139762","https://openalex.org/W1980424220","https://openalex.org/W1990666952","https://openalex.org/W1993304147","https://openalex.org/W1995027289","https://openalex.org/W1996575062","https://openalex.org/W2001139415","https://openalex.org/W2011823863","https://openalex.org/W2030460280","https://openalex.org/W2057463094","https://openalex.org/W2064493067","https://openalex.org/W2065320942","https://openalex.org/W2079730767","https://openalex.org/W2086565575","https://openalex.org/W2090987888","https://openalex.org/W2096212808","https://openalex.org/W2112306992","https://openalex.org/W2122466336","https://openalex.org/W2167637346","https://openalex.org/W2168919539","https://openalex.org/W2552383377","https://openalex.org/W2571554181","https://openalex.org/W2611854190","https://openalex.org/W2741464441","https://openalex.org/W2779965945","https://openalex.org/W2883647592","https://openalex.org/W2964227682","https://openalex.org/W2964273566","https://openalex.org/W2971430063"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W2044443696","https://openalex.org/W1703428550","https://openalex.org/W2503538928","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1971863547"],"abstract_inverted_index":{"Karger":[0,68],"used":[1],"spanning":[2],"tree":[3,92,102,188,339],"packings":[4,93],"[D.":[5,50],"R.":[6,51,67],"Karger,":[7,52],"J.":[8,72,168,171,325],"ACM,":[9,73,116],"47":[10],"(2000),":[11,317],"pp.":[12,76,118,158,176,318,330],"46--76]":[13],"to":[14,212,218,230,276,301,306,349],"derive":[15],"a":[16,30,41,80,187,239,257],"near":[17],"linear-time":[18],"randomized":[19],"algorithm":[20,49,83,223,237],"for":[21,84,130,201,210,280],"the":[22,33,85,107,145,181,184,198,202,213,219,222,232,246,249,261,265,277,289,295,303,307,336,350],"global":[23],"minimum":[24,37,86],"cut":[25],"problem":[26,88],"as":[27,29],"well":[28],"bound":[31,196,247],"on":[32,112,150,197,248],"number":[34,250],"of":[35,106,114,126,144,183,221,235,241,251,264,283,292,294,311],"approximate":[36],"cuts.":[38],"This":[39,298],"is":[40,267,285],"different":[42],"approach":[43,310],"from":[44],"his":[45],"well-known":[46],"random":[47],"contraction":[48],"Random":[53],"Sampling":[54],"in":[55,104,142,162],"Graph":[56],"Optimization":[57],"Problems,":[58],"Ph.D.":[59],"thesis,":[60],"Stanford":[61],"University,":[62],"Stanford,":[63],"CA,":[64],"1995,":[65],"D.":[66],"and":[69,135,139,160,167,205,224,320,322],"C.":[70],"Stein,":[71],"43":[74],"(1996),":[75],"601--640].":[77],"Thorup":[78,343],"developed":[79],"fast":[81],"deterministic":[82,100],"$k$-cut":[87,214],"via":[89,99],"greedy":[90,101],"recursive":[91,338],"[M.":[94],"Thorup,":[95],"Minimum":[96],"$k$-way":[97],"cuts":[98],"packing,":[103],"Proceedings":[105,143],"Fortieth":[108],"Annual":[109,147],"ACM":[110],"Symposium":[111,149],"Theory":[113],"Computing,":[115],"2008,":[117],"159--166].":[119],"In":[120,216],"this":[121,227],"paper":[122],"we":[123,255,270],"revisit":[124],"properties":[125],"an":[127,194,273,345],"LP":[128,185,266,278,304],"relaxation":[129,305,309],"c\u0345ut":[131],"proposed":[132],"by":[133,238,288,342],"Naor":[134],"Rabani":[136],"[Tree":[137],"packing":[138,189,340],"approximating":[140],"$k$-cuts,":[141],"Twelfth":[146],"ACM-SIAM":[148],"Discrete":[151,172],"Algorithms,":[152],"Vol.":[153],"103,":[154],"SIAM,":[155],"Philadelphia,":[156],"2001,":[157],"26--27],":[159],"analyzed":[161],"[C.":[163],"Chekuri,":[164],"S.":[165],"Guha,":[166],"Naor,":[169],"SIAM":[170],"Math.,":[173],"20":[174],"(2006),":[175],"261--271].":[177],"We":[178,243],"show":[179,271],"that":[180,260,272,335],"dual":[182,347],"yields":[186],"that,":[190],"when":[191],"combined":[192],"with":[193],"upper":[195],"integrality":[199,262],"gap":[200,263],"LP,":[203],"easily":[204],"transparently":[206],"extends":[207],"Karger's":[208],"analysis":[209],"mincut":[211],"problem.":[215],"addition":[217],"simplicity":[220],"its":[225],"analysis,":[226],"allows":[228,299],"us":[229,300],"improve":[231,245],"running":[233],"time":[234],"Thorup's":[236],"factor":[240],"$n$.":[242],"also":[244,333],"$\\alpha$-approximate":[252],"$k$-cuts.":[253],"Second,":[254],"give":[256],"simple":[258],"proof":[259],"$2(1-1/n)$.":[268],"Third,":[269],"optimum":[274,346],"solution":[275,348],"relaxation,":[279],"all":[281],"values":[282],"$k$,":[284],"fully":[286],"determined":[287],"principal":[290],"sequence":[291],"partitions":[293],"input":[296],"graph.":[297],"relate":[302],"Lagrangean":[308],"Barahona":[312],"[Oper.":[313],"Res.":[314],"Lett.,":[315],"26":[316],"99--105]":[319],"Ravi":[321],"Sinha":[323],"[European":[324],"Oper.":[326],"Res.,":[327],"186":[328],"(2008),":[329],"77--90];":[331],"it":[332],"shows":[334],"idealized":[337],"considered":[341],"gives":[344],"LP.":[351]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}