Brief Announcement: Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network

We consider the Shallow-Light Steiner Network problem from a fixed-parameter perspective. Given a graph G, a distance bound L, and p pairs of vertices (s1, t1), . . . , (sp, tp), the objective is to find a minimum-cost subgraph G′ such that si and ti have distance at most L in G′ (for every i ∈ [p]). Our main result is on the fixed-parameter tractability of this problem with parameter p. We exactly characterize the demand structures that make the problem “easy”, and give FPT algorithms for those cases. In all other cases, we show that the problem is W[1]-hard. We also extend our results to handle general edge lengths and costs, precisely characterizing which demands allow for good FPT approximation algorithms and which demands remain W[1]-hard even to approximate.

[1]  Alex Zelikovsky,et al.  Improved Steiner tree approximation in graphs , 2000, SODA '00.

[2]  Jon Feldman,et al.  The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals , 2006, SIAM J. Comput..

[3]  Michael Dinitz,et al.  Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds , 2017, SODA.

[4]  Pasin Manurangsi,et al.  Parameterized Approximation Algorithms for Directed Steiner Network Problems , 2017, ESA.

[5]  Michael Dinitz,et al.  Timely, Reliable, and Cost-Effective Internet Transport Service Using Dissemination Graphs , 2017, 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS).

[6]  Amir Abboud,et al.  Reachability Preservers: New Extremal Bounds and Approximation Algorithms , 2017, SODA.

[7]  Kamal Jain,et al.  A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[8]  A. Zelikovsky.  Better approximation bounds for the network and Euclidean Steiner tree problems , 1996 .

[9]  David P. Williamson,et al.  A general approximation technique for constrained forest problems , 1992, SODA '92.

[10]  Danny Raz,et al.  A simple efficient approximation scheme for the restricted shortest path problem , 2001, Oper. Res. Lett..

[11]  Fabrizio Grandoni,et al.  Steiner Tree Approximation via Iterative Randomized Rounding , 2013, JACM.

[12]  Joseph Naor,et al.  Improved approximations for shallow-light spanning trees , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[13]  Mohammad Taghi Hajiaghayi,et al.  Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth , 2009, JACM.

[14]  Samir Khuller,et al.  On directed Steiner trees , 2002, SODA '02.

[15]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[16]  D. Peleg,et al.  Approximating shallow-light trees , 1997, SODA '97.

[17]  Anupam Gupta,et al.  Set connectivity problems in undirected graphs and the directed Steiner network problem , 2008, SODA 2008.

[18]  Michael R. Fellows,et al.  On the parameterized complexity of multiple-interval graph problems , 2009, Theor. Comput. Sci..

[19]  Mohammad Taghi Hajiaghayi,et al.  Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees , 2007, Algorithmica.

[20]  Refael Hassin,et al.  Approximation Schemes for the Restricted Shortest Path Problem , 1992, Math. Oper. Res..

[21]  Luca Trevisan,et al.  From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[22]  S. E. Dreyfus,et al.  The steiner problem in graphs , 1971, Networks.

[23]  R. Ravi,et al.  When trees collide: an approximation algorithm for the generalized Steiner problem on networks , 1991, STOC '91.

[24]  Hong Shen,et al.  On the Shallow-Light Steiner Tree Problem , 2014, 2014 15th International Conference on Parallel and Distributed Computing, Applications and Technologies.

[25]  Dániel Marx,et al.  The Complexity Landscape of Fixed-Parameter Directed Steiner Network Problems , 2017, ICALP.

[26]  Piotr Berman,et al.  Improved approximations for the Steiner tree problem , 1992, SODA '92.

[27]  Sudipto Guha,et al.  Approximation algorithms for directed Steiner problems , 1999, SODA '98.