{"id":"https://openalex.org/W4302769223","doi":"https://doi.org/10.1145/2644814","title":"Approximation Algorithms and Hardness of the <i>k</i> -Route Cut Problem","display_name":"Approximation Algorithms and Hardness of the <i>k</i> -Route Cut Problem","publication_year":2015,"publication_date":"2015-12-31","ids":{"openalex":"https://openalex.org/W4302769223","doi":"https://doi.org/10.1145/2644814"},"language":"en","primary_location":{"id":"doi:10.1145/2644814","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2644814","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2644814","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/2644814","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056023203","display_name":"Julia Chuzhoy","orcid":"https://orcid.org/0000-0001-7839-751X"},"institutions":[{"id":"https://openalex.org/I160992636","display_name":"Toyota Technological Institute at Chicago","ror":"https://ror.org/02sn5gb64","country_code":"US","type":"education","lineage":["https://openalex.org/I160992636"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Julia Chuzhoy","raw_affiliation_strings":["Toyota Technological Institute at Chicago, Chicago, IL"],"affiliations":[{"raw_affiliation_string":"Toyota Technological Institute at Chicago, Chicago, IL","institution_ids":["https://openalex.org/I160992636"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068045392","display_name":"Yury Makarychev","orcid":"https://orcid.org/0000-0003-3114-3947"},"institutions":[{"id":"https://openalex.org/I160992636","display_name":"Toyota Technological Institute at Chicago","ror":"https://ror.org/02sn5gb64","country_code":"US","type":"education","lineage":["https://openalex.org/I160992636"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yury Makarychev","raw_affiliation_strings":["Toyota Technological Institute at Chicago, Chicago, IL"],"affiliations":[{"raw_affiliation_string":"Toyota Technological Institute at Chicago, Chicago, IL","institution_ids":["https://openalex.org/I160992636"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081431077","display_name":"Aravindan Vijayaraghavan","orcid":"https://orcid.org/0000-0001-9734-3779"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aravindan Vijayaraghavan","raw_affiliation_strings":["Princeton University"],"affiliations":[{"raw_affiliation_string":"Princeton University","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045927034","display_name":"Yuan Zhou","orcid":"https://orcid.org/0009-0008-1706-6539"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yuan Zhou","raw_affiliation_strings":["Carnegie Mellon University"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5056023203"],"corresponding_institution_ids":["https://openalex.org/I160992636"],"apc_list":null,"apc_paid":null,"fwci":0.7277,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.77805666,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"12","issue":"1","first_page":"1","last_page":"40"},"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.9994999766349792,"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.9994999766349792,"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.9890999794006348,"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/T10237","display_name":"Cryptography and Data Security","score":0.9873999953269958,"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/combinatorics","display_name":"Combinatorics","score":0.6907913684844971},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6437364220619202},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6223423480987549},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6012700796127319},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5280196070671082},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.4951120913028717},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47656726837158203},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.46629589796066284},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4645082354545593},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4266176223754883},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.42427825927734375},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.41329213976860046},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.31286513805389404}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6907913684844971},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6437364220619202},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6223423480987549},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6012700796127319},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5280196070671082},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.4951120913028717},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47656726837158203},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.46629589796066284},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4645082354545593},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4266176223754883},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.42427825927734375},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.41329213976860046},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.31286513805389404},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","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},{"id":"https://openalex.org/C188082640","wikidata":"https://www.wikidata.org/wiki/Q1780899","display_name":"Complementation","level":4,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C127716648","wikidata":"https://www.wikidata.org/wiki/Q104053","display_name":"Phenotype","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2644814","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2644814","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2644814","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/2644814","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2644814","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/2644814","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7257584671","display_name":"CAREER: Approximation Algorithms and Hardness of Network Optimization Problems","funder_award_id":"0844872","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8010271620","display_name":null,"funder_award_id":"CCF-0844872","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":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4302769223.pdf","grobid_xml":"https://content.openalex.org/works/W4302769223.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W1519184063","https://openalex.org/W1524698561","https://openalex.org/W1540498526","https://openalex.org/W1571037334","https://openalex.org/W1571257748","https://openalex.org/W1965641578","https://openalex.org/W1970259241","https://openalex.org/W1972913305","https://openalex.org/W2013965337","https://openalex.org/W2019404063","https://openalex.org/W2019578639","https://openalex.org/W2020632401","https://openalex.org/W2030365814","https://openalex.org/W2044343300","https://openalex.org/W2045395359","https://openalex.org/W2052687843","https://openalex.org/W2072802070","https://openalex.org/W2082707864","https://openalex.org/W2084086571","https://openalex.org/W2093227716","https://openalex.org/W2115049345","https://openalex.org/W2121085314","https://openalex.org/W2148352980","https://openalex.org/W2150148016","https://openalex.org/W2152986618","https://openalex.org/W2161556771","https://openalex.org/W2161719898","https://openalex.org/W2167061810","https://openalex.org/W2169528477","https://openalex.org/W2561675875","https://openalex.org/W3121437753"],"related_works":["https://openalex.org/W2962917430","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W1496354680","https://openalex.org/W2004283824","https://openalex.org/W2952847377","https://openalex.org/W2070751425","https://openalex.org/W2113270940","https://openalex.org/W2963158951","https://openalex.org/W1581210843"],"abstract_inverted_index":{"We":[0,165,203,229,246],"study":[1,233],"the":[2,53,69,87,91,118,122,140,162,193,265,277],"k":[3,51,83,100,144,157,170,196,221],"-route":[4],"cut":[5],"problem:":[6],"given":[7],"an":[8,47,167],"undirected":[9],"edge-weighted":[10],"graph":[11],"G":[12,112],"=":[13],"(":[14,28,36,74,99,169],"V":[15],",":[16,24,31,39,52,77],"E":[17,61,114],"),":[18,27,34],"a":[19,58,200,218,234,248],"collection":[20],"{(":[21],"s":[22,29,37,75,106],"1":[23,26],"t":[25,32,40,78,109],"2":[30,33],"\u2026,":[35],"r":[38,41,173],")}":[42],"of":[43,63,71,220,237,264,282],"source-sink":[44,242,279],"pairs,":[45],"and":[46,182,190,256],"integer":[48],"connectivity":[49,70,194],"requirement":[50,92,124,195],"goal":[54],"is":[55,93,125,197,212,244],"to":[56,65,108,130,214,216,232,270],"find":[57],"minimum-weight":[59],"subset":[60],"\u2032":[62],"edges":[64],"remove,":[66],"such":[67],"that":[68,94,210,259,276],"every":[72],"pair":[73,243,280],"i":[76,79,107,110],")":[80],"falls":[81],"below":[82],".":[84],"Specifically,":[85],"in":[86,111,117,161],"edge-connectivity":[88],"version,":[89,120],"EC-kRC,":[90],"there":[95],"are":[96],"at":[97],"most":[98],"\u2212":[101],"1)":[102],"edge-disjoint":[103],"paths":[104],"connecting":[105],"\u2216":[113],"\u2032,":[115],"while":[116],"vertex-connectivity":[119],"VC-kRC,":[121,191,238],"same":[123],"for":[126,139,154,176,188,223,253],"vertex-disjoint":[127],"paths.":[128],"Prior":[129],"our":[131],"work,":[132],"poly-logarithmic":[133],"approximation":[134,150,186,251],"algorithms":[135,151,187],"have":[136],"been":[137],"known":[138,153],"special":[141],"case":[142],"where":[143,192,239],"\u2a7d":[145],"3,":[146,159],"but":[147],"no":[148,285],"non-trivial":[149],"were":[152],"any":[155],"value":[156],"&gt;":[158,227],"except":[160],"single-source":[163],"setting.":[164],"show":[166,257],"O":[168],"log":[171],"3/2":[172],")-approximation":[174],"algorithm":[175,252],"EC-kRC":[177,189],"with":[178],"uniform":[179],"edge":[180],"weights,":[181],"several":[183],"polylogarithmic":[184],"bi-criteria":[185,250],"violated":[198],"by":[199,208],"constant":[201],"factor.":[202],"complement":[204],"these":[205],"upper":[206],"bounds":[207],"proving":[209],"VC-kRC":[211,283],"hard":[213,269],"approximate":[215],"within":[217],"factor":[219],"\u03f5":[222,226],"some":[224],"fixed":[225],"0.":[228],"then":[230],"turn":[231],"simpler":[235],"version":[236,263,281],"only":[240],"one":[241],"present.":[245],"give":[247],"simple":[249],"this":[254,261],"case,":[255],"evidence":[258],"even":[260],"restricted":[262],"problem":[266],"may":[267],"be":[268],"approximate.":[271],"For":[272],"example,":[273],"we":[274],"prove":[275],"single":[278],"has":[284],"constant-factor":[286],"approximation,":[287],"assuming":[288],"Feige\u2019s":[289],"Random":[290],"\u03ba-AND":[291],"assumption.":[292]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}