A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Approximating k-Spanner Problems for k > 2
[chapter]

2001
*
Lecture Notes in Computer Science
*

Given a graph G = (V , E), a subgraph G = (V , H ), H ⊆ E is a k-spanner of G if for any pair of vertices u, w ∈ V 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 log 1− n )inapproximable. The basic k-spanner problem over undirected graphs with k > 2 has been given a sublinear ratio

doi:10.1007/3-540-45535-3_8
fatcat:q32xzzhq4bdonjkjmpu6gmjvla