Abstract
A k-spanner of a connected graph G = (V,E) is a subgraph G\spr consisting of all the vertices of V and a subset of the edges, with the additional property that the distance between any two vertices in G\spr is larger than that distance in G by no more than a factor of k. This paper concerns the problem of finding a 2-spanner in a given graph, with minimum maximum degree. A randomized approximation algorithm is provided for this problem, with approximation ration of [O\tilde](D1/4).
Full Text
Paper version not known (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call