Abstract

Given a graph G=(V,E), a subgraph is a k-spanner of G if for any pair of vertices u,wV it satisfies d_H(u,w)kd_G(u,w). The basic k-spanner problem is to find a k-spanner of a given graph G with the smallest possible number of edges. This paper considers approximation algorithms for this and some related problems for k>2, known to be Ω(2^log1-μn)-inapproximable. The basic k-spanner problem over undirected graphs with k>2 has been given a sublinear ratio approximation algorithm (with ratio roughly O(n^2/(k+1))), but no such algorithms were known for other variants of the problem, including the directed and the client–server variants, as well as for the related k-DSS problem. We present the first approximation algorithms for these problems with sublinear approximation ratio. The second contribution of this paper is in characterizing some wide families of graphs on which the problems do admit a logarithmic and a polylogarithmic approximation ratios. These families are characterized as containing graphs that have optimal or “near-optimal” spanners with certain desirable properties, such as being a tree, having low arboricity or having low girth. All our results generalize to the directed and the client–server variants of the problems. As a simple corollary, we present an algorithm that given a graph G builds a subgraph with edges and stretch bounded by the tree-stretch of G, namely the minimum maximal stretch of a spanning tree for G. The analysis of our algorithms involves the novel notion of edge-dominating systems developed in the paper. The technique introduced in the paper reduces the studied algorithmic approximability questions on k-spanners to purely graph-theoretical questions concerning the existence of certain combinatorial objects in families of graphs.

Keywords: Graph algorithms; Approximation algorithms; Spanners