Tree Spanners for Subgraphs and Related Tree Covering Problems

For any fixed parameter k ≥ 1, a tree k-spanner of a graph G is a spanning tree T in G such that the distance between every pair of vertices in T is at most k times their distance in G. In this paper, we generalize on this very restrictive concept, and introduce Steiner tree k-spanners: We are given an input graph consisting of terminals and Steiner vertices, and we are now looking for a tree k-spanner that spans all terminals. The complexity status of deciding the existence of a Steiner tree k- spanner is easy for some k: it is NP-hard for k ≥ 4, and it is in P for k = 1. For the case k = 2, we develop a model in terms of an equivalent tree covering problem, and use this to show NP-hardness. By showing the NP-hardness also for the case k = 3, the complexity results for all k are complete. We also consider the problem of finding a smallest Steiner tree k-spanner (if one exists at all). For any arbitrary k ≥ 2, we prove that we cannot hope to find efficiently a Steiner tree k-spanner that is closer to the smallest one than within a logarithmic factor. We conclude by discussing some problems related to the model for the case k = 2.

[1]  Leizhen Cai,et al.  NP-Completeness of Minimum Spanner Problems , 1994, Discret. Appl. Math..

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[4]  Dagmar Handke,et al.  NP-Completeness Results for Minimum Planar Spanners , 1998, Discret. Math. Theor. Comput. Sci..

[5]  George N. Rouskas,et al.  Multicast routing with end-to-end delay and delay variation constraints , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[6]  Ioannis E. Papoutsakis,et al.  Two structure theorems on tree spanners , 1999 .

[7]  Frank Harary,et al.  Graph Theory , 2016 .

[8]  Uriel Feige.  A threshold of ln n for approximating set cover (preliminary version) , 1996, STOC '96.

[9]  Sándor P. Fekete,et al.  Tree spanners in planar graphs , 2001, Discret. Appl. Math..

[10]  David Peleg,et al.  The Hardness of Approximating Spanner Problems , 2000, STACS.

[11]  Guy Kortsarz,et al.  Generating Sparse 2-Spanners , 1994, J. Algorithms.

[12]  J. Soares.  Graph Spanners: a Survey , 1992 .

[13]  George N. Rouskas,et al.  Cost, Delay, and Delay Variation Conscious Multicast Routing , 1997 .

[14]  Guy Kortsarz.  On the Hardness of Approximation Spanners , 1998, APPROX.

[15]  Michiel H. M. Smid,et al.  Lower bounds for computing geometric spanners and approximate shortest paths , 1996, Discret. Appl. Math..

[16]  David P. Dobkin,et al.  On sparse spanners of weighted graphs , 1993, Discret. Comput. Geom..

[17]  C. Pandu Rangan,et al.  Tree 3-Spanners on Interval, Permutation and Regular Bipartite Graphs , 1996, Inf. Process. Lett..

[18]  David Peleg,et al.  An optimal synchronizer for the hypercube , 1987, PODC '87.

[19]  Jose Augusto Ramos Soares,et al.  Graph Spanners: a Survey , 1992 .

[20]  Feodor F. Dragan,et al.  Distance Approximating Trees for Chordal and Dually Chordal Graphs , 1999, J. Algorithms.

[21]  Pierluigi Crescenzi,et al.  A compendium of NP optimization problems , 1994, WWW Spring 1994.

[22]  Qing Zhu,et al.  A source-based algorithm for delay-constrained minimum-cost multicasting , 1995, Proceedings of INFOCOM'95.

[23]  Leizhen Cai,et al.  Tree Spanners , 1995, SIAM J. Discret. Math..

[24]  Guy Kortsarz.  On the Hardness of Approximating Spanners , 2001, Algorithmica.

[25]  Dagmar Handke,et al.  Graphs with distance guarantees , 1999 .

[26]  D. S. Johnson,et al.  Restrictions of Minimum Spanner Problems , 1997 .

[27]  Nicola Santoro,et al.  Labelling and Implicit Routing in Networks , 1985, Computer/law journal.