{"id":"https://openalex.org/W1974018476","doi":"https://doi.org/10.1145/1502793.1502795","title":"Polynomial flow-cut gaps and hardness of directed cut problems","display_name":"Polynomial flow-cut gaps and hardness of directed cut problems","publication_year":2009,"publication_date":"2009-04-01","ids":{"openalex":"https://openalex.org/W1974018476","doi":"https://doi.org/10.1145/1502793.1502795","mag":"1974018476"},"language":"en","primary_location":{"id":"doi:10.1145/1502793.1502795","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1502793.1502795","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","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/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":false,"raw_author_name":"Julia Chuzhoy","raw_affiliation_strings":["Toyota Technological Institute, Chicago, Illinois"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Toyota Technological Institute, Chicago, Illinois","institution_ids":["https://openalex.org/I160992636"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039619350","display_name":"Sanjeev Khanna","orcid":"https://orcid.org/0009-0000-2601-1689"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sanjeev Khanna","raw_affiliation_strings":["University of Pennsylvania, Philadelphia, Pennsylvania","UNIVERSITY OF PENNSYLVANIA PHILADELPHIA, PENNSYLVANIA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Pennsylvania, Philadelphia, Pennsylvania","institution_ids":["https://openalex.org/I79576946"]},{"raw_affiliation_string":"UNIVERSITY OF PENNSYLVANIA PHILADELPHIA, PENNSYLVANIA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.4817,"has_fulltext":false,"cited_by_count":45,"citation_normalized_percentile":{"value":0.88108129,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"56","issue":"2","first_page":"1","last_page":"28"},"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.9994000196456909,"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.9994000196456909,"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.9914000034332275,"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.9750000238418579,"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/minimum-cut","display_name":"Minimum cut","score":0.8866212368011475},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.832768440246582},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.7886171936988831},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7467057704925537},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7344410419464111},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.6758822202682495},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5806226134300232},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.5224246382713318},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5143665075302124},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4902530312538147},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4603542983531952},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4415535628795624},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.42964762449264526},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42643284797668457},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.319271445274353},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.26376253366470337},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11579746007919312},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1011573076248169}],"concepts":[{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.8866212368011475},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.832768440246582},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.7886171936988831},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7467057704925537},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7344410419464111},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.6758822202682495},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5806226134300232},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.5224246382713318},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5143665075302124},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4902530312538147},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4603542983531952},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4415535628795624},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.42964762449264526},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42643284797668457},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.319271445274353},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26376253366470337},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11579746007919312},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1011573076248169},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1145/1502793.1502795","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1502793.1502795","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.385.7543","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.385.7543","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ttic.uchicago.edu/~cjulia/papers/dir-multicut-journal.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.385.7808","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.385.7808","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ttic.uchicago.edu/~cjulia/papers/dir-multicut2.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.580.5065","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.580.5065","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ttic.uchicago.edu/~cjulia/papers/dir-multicut2-full.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.63.553","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.553","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cis.upenn.edu/~sanjeev/postscript/journal_dir_multicut.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.74.7951","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.74.7951","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cis.upenn.edu/~sanjeev/postscript/stoc07_multicut.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3631422143","display_name":null,"funder_award_id":"CCR-0093117","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G816287446","display_name":null,"funder_award_id":"CCF-0635084","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1485936828","https://openalex.org/W1571037334","https://openalex.org/W1595563493","https://openalex.org/W1964119857","https://openalex.org/W1979703213","https://openalex.org/W1986291656","https://openalex.org/W1996965889","https://openalex.org/W2008362572","https://openalex.org/W2009924457","https://openalex.org/W2020632401","https://openalex.org/W2044343300","https://openalex.org/W2045675568","https://openalex.org/W2070434785","https://openalex.org/W2072802070","https://openalex.org/W2078090052","https://openalex.org/W2078714635","https://openalex.org/W2120358419","https://openalex.org/W2123416347","https://openalex.org/W2125725829","https://openalex.org/W2126492985","https://openalex.org/W2133017912","https://openalex.org/W2140566134","https://openalex.org/W2150148016","https://openalex.org/W2152221184","https://openalex.org/W2152986618","https://openalex.org/W2153164535","https://openalex.org/W2161719898","https://openalex.org/W2167061810"],"related_works":["https://openalex.org/W2080904092","https://openalex.org/W3141688457","https://openalex.org/W3141113327","https://openalex.org/W2186707160","https://openalex.org/W2141353198","https://openalex.org/W2095284441","https://openalex.org/W3155269421","https://openalex.org/W2590727506","https://openalex.org/W1974018476","https://openalex.org/W2912098148"],"abstract_inverted_index":{"We":[0,185,221,300],"study":[1],"the":[2,5,13,31,36,53,57,72,75,81,103,111,123,127,136,140,148,153,158,167,191,235,288],"multicut":[3,14,98,176,257],"and":[4,30,152,174,197,258,315],"sparsest":[6,49,115,198,259],"cut":[7,50,116,133,160,199,260],"problems":[8],"in":[9,182,200,230],"directed":[10,183,201,256,337],"graphs.":[11,184,202,339],"In":[12],"problem,":[15,109],"we":[16],"are":[17,87,229,243,261],"a":[18,62,187,207,231,267,322],"given":[19],"an":[20],"n":[21,179,213,248,273,291,294],"-vertex":[22],"graph":[23],"G":[24],"along":[25],"with":[26,309],"k":[27],"source-sink":[28,46,84],"pairs,":[29],"goal":[32,58],"is":[33,59,134,165,177,253],"to":[34,60,66,70,80,102,118,234,245,263,265],"find":[35,61],"minimum":[37,154,175],"cardinality":[38],"subset":[39,63],"of":[40,64,74,77,83,126,211,218,269,305,318,326],"edges":[41,65,79],"whose":[42],"removal":[43],"separates":[44],"all":[45],"pairs.":[47],"The":[48,92],"problem":[51],"has":[52],"same":[54],"input,":[55],"but":[56],"delete":[67],"so":[68],"as":[69],"minimize":[71],"ratio":[73],"number":[76,82,317],"deleted":[78],"pairs":[85],"that":[86,166,223,254,303],"separated":[88],"by":[89,100],"this":[90],"deletion.":[91],"natural":[93],"linear":[94,128],"programming":[95,129],"relaxation":[96,130],"for":[97,114,131,144,157,190,215,275,297,307,328,336],"corresponds,":[99],"LP-duality,":[101],"well-studied":[104],"maximum":[105,119,149,171,194],"(fractional)":[106],"multicommodity":[107,172],"flow":[108,150,173,196],"while":[110],"standard":[112],"LP-relaxation":[113],"corresponds":[117],"concurrent":[120,195],"flow.":[121],"Therefore,":[122],"integrality":[124],"gap":[125,138,169,192],"multicut/sparsest":[132],"also":[135,301],"flow-cut":[137,168,219,227,241],":":[139],"largest":[141],"gap,":[142],"achievable":[143],"any":[145,276],"graph,":[146],"between":[147,170,193],"value":[151],"cost":[155],"solution":[156],"corresponding":[159],"problem.":[161],"Our":[162,250],"first":[163],"result":[164,189,252,296],"\u03a9\u02dc(":[178],"1/7":[180],")":[181,214,274],"show":[186,302],"similar":[188],"These":[203],"results":[204,334],"improve":[205],"upon":[206,287],"long-standing":[208],"lower":[209],"bound":[210],"\u03a9(log":[212,271,290],"both":[216,239,255,329],"types":[217],"gaps.":[220],"notice":[222],"these":[224,240,298,330],"polynomially":[225,312],"large":[226],"gaps":[228,242],"sharp":[232],"contrast":[233],"undirected":[236],"setting":[237],"where":[238],"known":[244],"be":[246],"\u0398(log":[247],").":[249],"second":[251],"hard":[262],"approximate":[264],"within":[266],"factor":[268,324],"2":[270],"1-\u03f5":[272],"constant":[277,316],"\u03f5":[278],">":[279],"0,":[280],"unless":[281],"NP":[282,308],"\u2286":[283],"ZPP.":[284],"This":[285],"improves":[286],"recent":[289],"/log":[292],"log":[293],")-hardness":[295],"problems.":[299,331],"existence":[304],"PCP's":[306],"perfect":[310],"completeness,":[311],"small":[313],"soundness,":[314],"queries":[319],"would":[320],"imply":[321],"polynomial":[323],"hardness":[325],"approximation":[327],"All":[332],"our":[333],"hold":[335],"acyclic":[338]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}