The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems

IF 0.8 Q3 COMPUTER SCIENCE, THEORY & METHODS
Andreas Emil Feldmann, Daniel Marx
{"title":"The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems","authors":"Andreas Emil Feldmann, Daniel Marx","doi":"10.1145/3580376","DOIUrl":null,"url":null,"abstract":"Given a directed graph G and a list ( s 1 , t 1 ), …, ( s d , t d ) of terminal pairs, the Directed Steiner Network problem asks for a minimum-cost subgraph of G that contains a directed s i → t i path for every 1 ≤ i ≤ d . The special case Directed Steiner Tree (when we ask for paths from a root r to terminals t 1 , …, t d ) is known to be fixed-parameter tractable parameterized by the number of terminals, while the special case Strongly Connected Steiner Subgraph (when we ask for a path from every t i to every other t j ) is known to be W[1]-hard parameterized by the number of terminals. We systematically explore the complexity landscape of directed Steiner problems to fully understand which other special cases are FPT or W[1]-hard. Formally, if \\({\\mathcal {H}} \\) is a class of directed graphs, then we look at the special case of Directed Steiner Network where the list ( s 1 , t 1 ), …, ( s d , t d ) of demands form a directed graph that is a member of \\({\\mathcal {H}} \\) . Our main result is a complete characterization of the classes \\({\\mathcal {H}} \\) resulting in fixed-parameter tractable special cases: we show that if every pattern in \\({\\mathcal {H}} \\) has the combinatorial property of being “transitively equivalent to a bounded-length caterpillar with a bounded number of extra edges,” then the problem is FPT, and it is W[1]-hard for every recursively enumerable \\({\\mathcal {H}} \\) not having this property. This complete dichotomy unifies and generalizes the known results showing that Directed Steiner Tree is FPT [Dreyfus and Wagner, Networks 1971], q -Root Steiner Tree is FPT for constant q [Suchý, WG 2016], Strongly Connected Steiner Subgraph is W[1]-hard [Guo et al., SIAM J. Discrete Math. 2011], and Directed Steiner Network is solvable in polynomial-time for constant number of terminals [Feldman and Ruhl, SIAM J. Comput. 2006], and moreover reveals a large continent of tractable cases that were not known before.","PeriodicalId":44045,"journal":{"name":"ACM Transactions on Computation Theory","volume":"92 1","pages":"0"},"PeriodicalIF":0.8000,"publicationDate":"2023-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Computation Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3580376","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

Given a directed graph G and a list ( s 1 , t 1 ), …, ( s d , t d ) of terminal pairs, the Directed Steiner Network problem asks for a minimum-cost subgraph of G that contains a directed s i → t i path for every 1 ≤ i ≤ d . The special case Directed Steiner Tree (when we ask for paths from a root r to terminals t 1 , …, t d ) is known to be fixed-parameter tractable parameterized by the number of terminals, while the special case Strongly Connected Steiner Subgraph (when we ask for a path from every t i to every other t j ) is known to be W[1]-hard parameterized by the number of terminals. We systematically explore the complexity landscape of directed Steiner problems to fully understand which other special cases are FPT or W[1]-hard. Formally, if \({\mathcal {H}} \) is a class of directed graphs, then we look at the special case of Directed Steiner Network where the list ( s 1 , t 1 ), …, ( s d , t d ) of demands form a directed graph that is a member of \({\mathcal {H}} \) . Our main result is a complete characterization of the classes \({\mathcal {H}} \) resulting in fixed-parameter tractable special cases: we show that if every pattern in \({\mathcal {H}} \) has the combinatorial property of being “transitively equivalent to a bounded-length caterpillar with a bounded number of extra edges,” then the problem is FPT, and it is W[1]-hard for every recursively enumerable \({\mathcal {H}} \) not having this property. This complete dichotomy unifies and generalizes the known results showing that Directed Steiner Tree is FPT [Dreyfus and Wagner, Networks 1971], q -Root Steiner Tree is FPT for constant q [Suchý, WG 2016], Strongly Connected Steiner Subgraph is W[1]-hard [Guo et al., SIAM J. Discrete Math. 2011], and Directed Steiner Network is solvable in polynomial-time for constant number of terminals [Feldman and Ruhl, SIAM J. Comput. 2006], and moreover reveals a large continent of tractable cases that were not known before.
定参数有向Steiner网络问题的复杂性格局
给定一个有向图G和一个末端对的列表(s1, t1),…,(s1, t1),有向斯坦纳网络问题要求求G的一个最小代价子图,该子图在每1≤i≤d时包含一条有向路径s1→t1。特殊情况下的有向斯坦纳树(当我们要求从根r到终端t1,…,t d的路径时)已知是由终端数量参数化的固定参数可处理的,而特殊情况下的强连通斯坦纳子图(当我们要求从每t i到每其他t j的路径时)已知是W[1]-由终端数量硬参数化的。我们系统地探索有向斯坦纳问题的复杂性景观,以充分了解哪些其他特殊情况是FPT或W[1]-困难的。形式上,如果\({\mathcal {H}} \)是一类有向图,那么我们看有向斯坦纳网络的特殊情况,其中需求的列表(s 1, t 1),…,(s d, t d)构成一个有向图,该有向图是\({\mathcal {H}} \)的成员。我们的主要结果是对类\({\mathcal {H}} \)的完整描述,导致固定参数可处理的特殊情况:我们表明,如果\({\mathcal {H}} \)中的每个模式都具有“传递等效于具有有限数量的额外边的有限长度的毛虫”的组合性质,那么问题是FPT,并且对于每个递归可枚举的\({\mathcal {H}} \)都很难不具有此性质。这一完全二分类统一并推广了已知的结果,表明有向斯坦纳树是FPT [Dreyfus and Wagner, Networks 1971], q -根斯坦纳树是常数q的FPT [Suchý, WG 2016],强连通斯坦纳子图是W[1]-hard [Guo等,SIAM J. Discrete Math. 2011],有向斯坦纳网络在常数终端数的多项式时间内可解[Feldman and Ruhl, SIAM J. Comput. 2006],而且还揭示了以前不为人知的一大片可处理病例。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
ACM Transactions on Computation Theory
ACM Transactions on Computation Theory COMPUTER SCIENCE, THEORY & METHODS-
CiteScore
2.30
自引率
0.00%
发文量
10
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信