Abstract
A t-spanner of a graph G is a spanning subgraph S in which the distance between every pair of vertices is at most t times their distance in G. If S is required to be a tree then S is called a tree t -spanner of G. In 1998, Fekete and Kremer showed that on unweighted planar graphs the tree t -spanner problem (the problem to decide whether G admits a tree t-spanner) is polynomial time solvable for t ≤ 3 and is NP-complete as long as t is part of the input. They also left as an open problem whether the tree t-spanner problem is polynomial time solvable for every fixed t ≥ 4. In this work we resolve this open problem and extend the solution in several directions. We show that for every fixed t, it is possible in polynomial time not only to decide if a planar graph G has a tree t-spanner, but also to decide if G has a t-spanner of bounded treewidth. Moreover, for every fixed values of t and k, the problem, for a given planar graph G to decide if G has a t-spanner of treewidth at most k, is not only polynomial time solvable, but is fixed parameter tractable (with k and t being the parameters). In particular, the running time of our algorithm is linear with respect to the size of G. We extend this result from planar to a much more general class of sparse graphs containing graphs of bounded genus. An apex graph is a graph obtained from a planar graph G by adding a vertex and making it adjacent to some vertices of G. We show that the problem of finding a t-spanner of treewidth k is fixed parameter tractable on graphs that do not contain some fixed apex graph as a minor, i.e. on apex-minor-free graphs. Graphs of bounded treewidth are sparse graphs and our technique can be used to settle the complexity of the parameterized version of the sparse t -spanner problem, where for given t and m one asks if a given n-vertex graph has a t-spanner with at most n − 1 + m edges. Our results imply that the sparse t-spanner problem is fixed parameter tractable on apex-minor-free graphs with t and m being the parameters. Finally we show that the tractability border of the t-spanner problem cannot be extended beyond the class of apex-minor-free graphs. In particular, we prove that for every t ≥ 4, the problem of finding a tree t-spanner is NP-complete on K 6 -minor-free graphs. Thus our results are tight, in a sense that the restriction of input graph being apex-minor-free cannot be replaced by H-minor-free for some non-apex fixed graph H.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alber, J., Bodlaender, H.L., Fernau, H., Kloks, T., Niedermeier, R.: Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica 33, 461–493 (2002)
Bartal, Y.: Probabilistic approximation of metric spaces and its algorithmic applications. In: FOCS 1996, pp. 184–193 (1996)
Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25, 1305–1317 (1996)
Boksberger, P., Kuhn, F., Wattenhofer, R.: On the approximation of the minimum maximum stretch tree problem, Tech. Report 409, ETH Zürich, Switzerland (2003)
Brandes, U., Handke, D.: P-completeness results for minimum planar spanners. Discrete Mathematics & Theoretical Computer Science 3, 1–10 (1998)
Cai, L., Corneil, D.G.: Tree spanners. SIAM J. Discrete Math. 8, 359–387 (1995)
Charikar, M., Chekuri, C., Goel, A., Guha, S., Plotkin, S.: Approximating a Finite Metric by a Small Number of Tree Metrics. In: FOCS 1998, pp. 379–388 (1998)
Courcelle, B.: The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation 85, 12–75 (1990)
Courcelle, B.: The monadic second-order logic of graphs III: Treewidth, forbidden minors and complexity issues. Informatique Théorique 26, 257–286 (1992)
Courcelle, B.: The expression of graph properties and graph transformations in monadic second-order logic. In: Handbook of graph grammars and computing by graph transformation, vol. 1, pp. 313–400. World Sci. Publ., River Edge (1997)
Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Bidimensional parameters and local treewidth. SIAM J. Discrete Math. 18, 501–511 (2004)
Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs. Journal of the ACM 52, 866–893 (2005)
Demaine, E.D., Hajiaghayi, M.: Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality. In: SODA 2005, pp. 682–689 (2005)
Demmer, M.J., Herlihy, M.: The arrow distributed directory protocol. In: Kutten, S. (ed.) DISC 1998. LNCS, vol. 1499, pp. 119–133. Springer, Heidelberg (1998)
Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer, New York (1999)
Dragan, F.F., Fomin, F.V., Golovach, P.A.: Spanners in sparse graphs, Tech. Rep. 366, Dept. of informatics, University of Bergen (2008), http://www.ii.uib.no/publikasjoner/texrap/pdf/2008-366.pdf
Duckworth, W., Wormald, N.C., Zito, M.: A PTAS for the sparsest 2-spanner of 4-connected planar triangulations. J. of Discrete Algorithms 1, 67–76 (2003)
Elkin, M., Peleg, D.: Strong Inapproximability of the Basic k-Spanner Problem. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 636–647. Springer, Heidelberg (2000)
Elkin, M., Peleg, D.: The Hardness of Approximating Spanner Problems. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 370–381. Springer, Heidelberg (2000)
Elkin, M., Peleg, D.: Approximating k-spanner problems for k > 2. Theoretical Computer Science 337, 249–277 (2005)
Emek, Y., Peleg, D.: Approximating minimum max-stretch spanning trees on unweighted graphs. In: SODA 2004, pp. 261–270 (2004)
Fekete, S.P., Kremer, J.: Tree spanners in planar graphs. Discrete Appl. Math. 108, 85–103 (2001)
Geelen, J.F., Richter, R.B., Salazar, G.: Embedding grids in surfaces. European J. Combin. 25, 785–792 (2004)
Herlihy, M., Tirthapura, S., Wattenhofer, R.: Competitive concurrent distributed queuing. In: PODC 2001, pp. 127–133 (2001)
Linial, N., London, E., Rabinovich, Y.: The geometry of graphs and some its algorithmic applications. Combinatorica 15, 215–245 (1995)
Mohar, B.: Combinatorial local planarity and the width of graph embeddings. Canad. J. Math. 44, 1272–1288 (1992)
Peleg, D.: Low stretch spanning trees. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol. 2420, pp. 68–80. Springer, Heidelberg (2002)
Peleg, D., Schäffer, A.A.: Graph Spanners. J. Graph Theory 13, 99–116 (1989)
Peleg, D., Tendler, D.: Low stretch spanning trees for planar graphs, Tech. Report MCS01-14, Weizmann Science Press of Israel, Israel (2001)
Peleg, D., Ullman, J.D.: An optimal synchronizer for the hypercube. In: PODC 1987, pp. 77–85 (1987)
Peleg, D., Upfal, E.: A tradeoff between space and efficiency for routing tables. In: STOC 1988, pp. 43–52 (1988)
Robertson, N., Seymour, P.D.: Graph minors. XVI. Excluding a non-planar graph. J. Combin. Theory Ser. B 89, 43–76 (2003)
Robertson, N., Seymour, P.D., Thomas, R.: Quickly excluding a planar graph. J. Comb. Theory, Ser. B 62, 323–348 (1994)
Seymour, P.D., Thomas, R.: Call routing and the ratcatcher. Combinatorica 14, 217–241 (1994)
Thomassen, C.: A simpler proof of the excluded minor theorem for higher surfaces. J. Combin. Theory Ser. B 70, 306–311 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dragan, F.F., Fomin, F.V., Golovach, P.A. (2008). Spanners in Sparse Graphs. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds) Automata, Languages and Programming. ICALP 2008. Lecture Notes in Computer Science, vol 5125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70575-8_49
Download citation
DOI: https://doi.org/10.1007/978-3-540-70575-8_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70574-1
Online ISBN: 978-3-540-70575-8
eBook Packages: Computer ScienceComputer Science (R0)