{"id":"https://openalex.org/W3022139975","doi":"https://doi.org/10.1137/20m1383197","title":"A Parameterized Approximation Scheme for Min $k$-Cut","display_name":"A Parameterized Approximation Scheme for Min $k$-Cut","publication_year":2022,"publication_date":"2022-04-25","ids":{"openalex":"https://openalex.org/W3022139975","doi":"https://doi.org/10.1137/20m1383197","mag":"3022139975"},"language":"en","primary_location":{"id":"doi:10.1137/20m1383197","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1383197","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":["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/A5038531405","display_name":"Daniel Lokshtanov","orcid":"https://orcid.org/0000-0002-3166-9212"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Lokshtanov","raw_affiliation_strings":["University of California, Santa Barbara, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Santa Barbara, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015806060","display_name":"Saket Saurabh","orcid":"https://orcid.org/0000-0001-7847-6402"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]},{"id":"https://openalex.org/I59611059","display_name":"Institute of Mathematical Sciences","ror":"https://ror.org/05078rg59","country_code":"IN","type":"facility","lineage":["https://openalex.org/I59611059"]}],"countries":["IN","NO"],"is_corresponding":false,"raw_author_name":"Saket Saurabh","raw_affiliation_strings":["The Institute of Mathematical Sciences, HBNI, Chennai, India, and","University of Bergen, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Institute of Mathematical Sciences, HBNI, Chennai, India, and","institution_ids":["https://openalex.org/I59611059"]},{"raw_affiliation_string":"University of Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072972143","display_name":"Vaishali Surianarayanan","orcid":"https://orcid.org/0000-0003-3091-3823"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vaishali Surianarayanan","raw_affiliation_strings":["University of California, Santa Barbara, USA"],"raw_orcid":"https://orcid.org/0000-0003-3091-3823","affiliations":[{"raw_affiliation_string":"University of California, Santa Barbara, USA","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.00759069,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"53","issue":"6","first_page":"FOCS20","last_page":"205"},"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.9990000128746033,"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.9990000128746033,"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.9947999715805054,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9944000244140625,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8140625953674316},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7050162553787231},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6975955963134766},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5911434292793274},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.5588628649711609},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5196929574012756},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5057051181793213},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39708396792411804},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.31238722801208496},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3112553358078003}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8140625953674316},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7050162553787231},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6975955963134766},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5911434292793274},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.5588628649711609},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5196929574012756},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5057051181793213},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39708396792411804},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.31238722801208496},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3112553358078003}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/20m1383197","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1383197","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1519147138","https://openalex.org/W1543491698","https://openalex.org/W1595409123","https://openalex.org/W1981519953","https://openalex.org/W1990666952","https://openalex.org/W1995027289","https://openalex.org/W2005887911","https://openalex.org/W2023039219","https://openalex.org/W2030460280","https://openalex.org/W2060785476","https://openalex.org/W2082618810","https://openalex.org/W2091264711","https://openalex.org/W2121641644","https://openalex.org/W2122466336","https://openalex.org/W2129939288","https://openalex.org/W2150148016","https://openalex.org/W2167637346","https://openalex.org/W2168919539","https://openalex.org/W2264676752","https://openalex.org/W2471129545","https://openalex.org/W2613308084","https://openalex.org/W2899702797","https://openalex.org/W2914414140","https://openalex.org/W2950509221","https://openalex.org/W2953221689","https://openalex.org/W2962822130","https://openalex.org/W2962996851","https://openalex.org/W2964227682","https://openalex.org/W2964273566","https://openalex.org/W2971430063","https://openalex.org/W2996801447","https://openalex.org/W3034552259","https://openalex.org/W3036281379","https://openalex.org/W3113894442"],"related_works":["https://openalex.org/W1034070228","https://openalex.org/W2492498253","https://openalex.org/W3135299686","https://openalex.org/W4206498635","https://openalex.org/W2951185106","https://openalex.org/W4230677477","https://openalex.org/W2118860231","https://openalex.org/W2028468530","https://openalex.org/W2419219947","https://openalex.org/W3102280101"],"abstract_inverted_index":{"In":[0,199,233],"the":[1,5,19,24,33,37,51,53,68,75,86,103,108,122,129,170,224,231,240,290],"Min":[2,109,191],"$k$-Cut":[3,110,192],"problem,":[4],"input":[6],"consists":[7],"of":[8,36,50,77,85,105,125,128,136,169,253,292,302],"an":[9,15],"edge":[10],"weighted":[11],"graph":[12,269],"$G$":[13],"and":[14,18,57,82,112,155,166,213,228,274],"integer":[16],"$k$,":[17],"task":[20],"is":[21,44,48,55],"to":[22,59,223],"partition":[23],"vertex":[25],"set":[26,124],"into":[27,270],"$k$":[28,47],"nonempty":[29],"sets,":[30],"such":[31],"that":[32,150],"total":[34],"weight":[35],"edges":[38,293],"with":[39,208,279],"endpoints":[40],"in":[41,118,152,160,194,230,247,294],"different":[42],"parts":[43],"minimized.":[45],"When":[46],"part":[49],"input,":[52],"problem":[54,69,111],"NP-complete":[56],"hard":[58],"approximate":[60],"within":[61],"any":[62],"factor":[63],"less":[64],"than":[65],"2.":[66],"Recently,":[67],"has":[70],"received":[71],"significant":[72],"attention":[73],"from":[74],"perspective":[76],"parameterized":[78,205],"approximation.":[79],"Gupta,":[80],"Lee,":[81],"Li":[83],"[Proceedings":[84,127,168],"29th":[87],"Annual":[88,132],"ACM-SIAM":[89,172],"Symposium":[90,133,173],"on":[91,134,174,219,283],"Discrete":[92,175],"Algorithms,":[93,176],"A.":[94],"Czumaj,":[95],"ed.,":[96,141,179],"SIAM,":[97,180],"Philadelphia,":[98,181],"2018,":[99,142],"pp.":[100,143,183],"2821--2837]":[101],"initiated":[102],"study":[104],"FPT-approximation":[106],"for":[107,190,235,266],"gave":[113,185],"a":[114,146,156,186,204,243,257,261,268,275,295],"1.9997-approximation":[115],"algorithm":[116,149,158,207,241,255,265,278],"running":[117,159,193,216,280],"time":[119,153,161,195,217,226,248,264,281],"$2^{\\mathcal{O}(k^6)}n^{\\mathcal{O}(1)}$.":[120],"Later,":[121],"same":[123],"authors":[126],"59th":[130],"IEEE":[131],"Foundations":[135],"Computer":[137],"Science,":[138],"M.":[139],"Thorup,":[140],"113--123]":[144],"designed":[145],"$(1":[147,244],"+\\epsilon)$-approximation":[148],"runs":[151],"$(k/\\epsilon)^{\\mathcal{O}(k)}n^{k+\\mathcal{O}(1)}$":[154],"1.81-approximation":[157],"$2^{\\mathcal{O}(k^2)}n^{\\mathcal{O}(1)}$.":[162],"More,":[163],"recently,":[164],"Kawarabayashi":[165],"Lin":[167],"31st":[171],"S.":[177],"Chawla,":[178],"2020,":[182],"990--999]":[184],"$(5/3":[187],"+":[188],"\\epsilon)$-approximation":[189],"$2^{\\mathcal{O}(k^2":[196],"\\log":[197],"k)}n^{\\mathcal{O}(1)}$.":[198],"this":[200],"paper,":[201],"we":[202],"give":[203],"approximation":[206,211],"best":[209,214],"possible":[210,215],"guarantee":[212,221],"dependence":[218],"said":[220],"(up":[222],"exponential":[225],"hypothesis":[227],"constants":[229],"exponent).":[232],"particular,":[234],"every":[236],"$\\epsilon":[237],">":[238],"0$,":[239],"obtains":[242],"+\\epsilon)$-approximate":[245],"solution":[246],"$(k/\\epsilon)^{\\mathcal{O}(k)}n^{\\mathcal{O}(1)}$.":[249],"The":[250,298],"main":[251],"ingredients":[252],"our":[254],"are":[256,301],"simple":[258],"sparsification":[259],"procedure,":[260],"new":[262,276],"polynomial":[263],"decomposing":[267],"highly":[271],"connected":[272],"parts,":[273],"exact":[277],"$s^{\\mathcal{O}(k)}n^{\\mathcal{O}(1)}$":[282],"unweighted":[284],"(multi-)":[285],"graphs.":[286],"Here,":[287],"$s$":[288],"denotes":[289],"number":[291],"minimum":[296],"$k$-cut.":[297],"latter":[299],"two":[300],"independent":[303],"interest.":[304]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}