{"id":"https://openalex.org/W4376639584","doi":"https://doi.org/10.1145/3564246.3585150","title":"Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth","display_name":"Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth","publication_year":2023,"publication_date":"2023-05-16","ids":{"openalex":"https://openalex.org/W4376639584","doi":"https://doi.org/10.1145/3564246.3585150"},"language":"en","primary_location":{"id":"doi:10.1145/3564246.3585150","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585150","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585150","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585150","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077389210","display_name":"Tobias Friedrich","orcid":"https://orcid.org/0000-0003-0076-6308"},"institutions":[{"id":"https://openalex.org/I143288331","display_name":"Hasso Plattner Institute","ror":"https://ror.org/058rn5r42","country_code":"DE","type":"facility","lineage":["https://openalex.org/I143288331","https://openalex.org/I176453806"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tobias Friedrich","raw_affiliation_strings":["Hasso Plattner Institute, Potsdam, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hasso Plattner Institute, Potsdam, Germany","institution_ids":["https://openalex.org/I143288331"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020686929","display_name":"Davis Issac","orcid":"https://orcid.org/0000-0001-5559-7471"},"institutions":[{"id":"https://openalex.org/I143288331","display_name":"Hasso Plattner Institute","ror":"https://ror.org/058rn5r42","country_code":"DE","type":"facility","lineage":["https://openalex.org/I143288331","https://openalex.org/I176453806"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Davis Issac","raw_affiliation_strings":["Hasso Plattner Institute, Potsdam, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hasso Plattner Institute, Potsdam, Germany","institution_ids":["https://openalex.org/I143288331"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101894598","display_name":"Nikhil Kumar","orcid":"https://orcid.org/0000-0002-0490-4600"},"institutions":[{"id":"https://openalex.org/I143288331","display_name":"Hasso Plattner Institute","ror":"https://ror.org/058rn5r42","country_code":"DE","type":"facility","lineage":["https://openalex.org/I143288331","https://openalex.org/I176453806"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Nikhil Kumar","raw_affiliation_strings":["Hasso Plattner Institute, Potsdam, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hasso Plattner Institute, Potsdam, Germany","institution_ids":["https://openalex.org/I143288331"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014513885","display_name":"Nadym Mallek","orcid":null},"institutions":[{"id":"https://openalex.org/I143288331","display_name":"Hasso Plattner Institute","ror":"https://ror.org/058rn5r42","country_code":"DE","type":"facility","lineage":["https://openalex.org/I143288331","https://openalex.org/I176453806"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Nadym Mallek","raw_affiliation_strings":["Hasso Plattner Institute, Potsdam, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hasso Plattner Institute, Potsdam, Germany","institution_ids":["https://openalex.org/I143288331"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046799116","display_name":"Ziena Zeif","orcid":"https://orcid.org/0000-0003-0378-1458"},"institutions":[{"id":"https://openalex.org/I143288331","display_name":"Hasso Plattner Institute","ror":"https://ror.org/058rn5r42","country_code":"DE","type":"facility","lineage":["https://openalex.org/I143288331","https://openalex.org/I176453806"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ziena Zeif","raw_affiliation_strings":["Hasso Plattner Institute, Potsdam, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hasso Plattner Institute, Potsdam, Germany","institution_ids":["https://openalex.org/I143288331"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I143288331"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1325","last_page":"1334"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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.9912999868392944,"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/treewidth","display_name":"Treewidth","score":0.8735520839691162},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7307760715484619},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7277780175209045},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.7023243308067322},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.5960230827331543},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5189797282218933},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46094071865081787},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.43434038758277893},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43382102251052856},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.4320175349712372},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.3461056351661682},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.23622876405715942},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.13808146119117737},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1247255802154541}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.8735520839691162},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7307760715484619},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7277780175209045},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.7023243308067322},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.5960230827331543},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5189797282218933},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46094071865081787},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.43434038758277893},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43382102251052856},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.4320175349712372},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3461056351661682},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.23622876405715942},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13808146119117737},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1247255802154541},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3564246.3585150","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585150","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585150","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3564246.3585150","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585150","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585150","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4376639584.pdf","grobid_xml":"https://content.openalex.org/works/W4376639584.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W1560551754","https://openalex.org/W2002531683","https://openalex.org/W2019062750","https://openalex.org/W2042899161","https://openalex.org/W2044343300","https://openalex.org/W2062157728","https://openalex.org/W2076164610","https://openalex.org/W2098322943","https://openalex.org/W2150148016","https://openalex.org/W2150815458","https://openalex.org/W4205585032"],"related_works":["https://openalex.org/W2012687409","https://openalex.org/W2889180046","https://openalex.org/W2029854525","https://openalex.org/W1976784955","https://openalex.org/W1976463682","https://openalex.org/W143512583","https://openalex.org/W1585579706","https://openalex.org/W1511821218","https://openalex.org/W1649387244","https://openalex.org/W2567822775"],"abstract_inverted_index":{"We":[0,113],"prove":[1],"an":[2,54],"approximate":[3],"max-multiflow":[4],"min-multicut":[5],"theorem":[6],"for":[7,86],"bounded":[8],"treewidth":[9],"graphs.":[10,93],"In":[11],"particular,":[12],"we":[13,78],"show":[14],"the":[15,50,87,99,104,110,118,125,136],"following:":[16],"Given":[17],"a":[18,23,31,81,131],"treewidth-r":[19,92],"graph,":[20],"there":[21],"exists":[22],"(fractional)":[24],"multicommodity":[25],"flow":[26],"of":[27,33,109],"value":[28],"f,":[29],"and":[30,63,77],"multicut":[32,89,111],"capacity":[34],"c":[35,40],"such":[36],"that":[37,49],"f":[38],"\u2264":[39,41],"O(ln(r+1))":[42],"\u00b7":[43],"f.":[44],"It":[45],"is":[46,67,75],"well":[47],"known":[48],"multiflow-multicut":[51],"gap":[52],"on":[53,91],"r-vertex":[55],"(constant":[56],"degree)":[57],"expander":[58],"graph":[59],"can":[60],"be":[61],"\u03a9(lnr),":[62],"hence":[64],"our":[65],"result":[66],"tight":[68],"up":[69],"to":[70,103,117,123],"constant":[71],"factors.":[72],"Our":[73,94],"proof":[74],"constructive,":[76],"also":[79],"obtain":[80],"polynomial":[82],"time":[83],"O(ln(r+1))-approximation":[84],"algorithm":[85,95,122],"minimum":[88],"problem":[90],"proceeds":[96],"by":[97],"rounding":[98,126],"optimal":[100],"fractional":[101],"solution":[102],"natural":[105],"linear":[106],"programming":[107],"relaxation":[108],"problem.":[112],"introduce":[114],"novel":[115],"modifications":[116],"well-known":[119],"region":[120],"growing":[121],"facilitate":[124],"while":[127],"guaranteeing":[128],"at":[129],"most":[130],"logarithmic":[132],"factor":[133],"loss":[134],"in":[135],"treewidth.":[137]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}