SODA
2001
ACM
13 years 6 months ago
2001
ACM
Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
ISAAC
2003
Springer
13 years 9 months ago
2003
Springer
Let T = (V, E, w) be an undirected and weighted tree with node set V and edge set E, where w(e) is an edge weight function for e ∈ E. The density of a path, say e1, e2, . . . , e...
STOC
2005
ACM
14 years 4 months ago
2005
ACM
A low-distortion embedding between two metric spaces is a mapping which preserves the distances between each pair of points, up to a small factor called distortion. Low-distortion...