Let G=(V, E) be an n-vertex connected graph with positive edge weights. A subgraph G′=(V, E′) is a t-spanner of G if for all u, v∈V, the weighted distance between u and v in G′ is at most t times the… Expand

We consider the problem of approximating the distances among points of a Euclidean metric space: given a finite setV of points in ℝd, we want to construct a sparset-spanner of the complete weighted graph induced byV.Expand

A bipartite graph G=(V,W,E) is convex if there exists an ordering of the vertices of W such that, for each v∈V, the neighbors of v are consecutive in W.Expand

We propose a factor 2@r-@r/(3@ r-2) approximation algorithm for the terminal Steiner tree problem, where @r is the approximation factor of a given algorithm.Expand