Cited By
View all- Sun YXiao XCui BHalgamuge SLappas TLuo J(2021)Finding group Steiner trees in graphs with both vertex and edge weightsProceedings of the VLDB Endowment10.14778/3450980.345098214:7(1137-1149)Online publication date: 12-Apr-2021
Metric embeddings have become a frequent tool in the design of algorithms. The applicability is often dependent on how high the embedding's distortion is. For example embedding into ultrametrics (or arbitrary trees) requires linear distortion. Using ...
A metric tree embedding of expected stretch α maps a weighted n-node graph G = (V, E, w) to a weighted tree T = (VT, ET, wT) with V ⊆ VT, and dist(v, w, G) ≤ dist(v, w, T) and E[dist(v, w, T)] ≤ α dist(v, w, G) for all v, w ∈ V. Such embeddings are ...
Society for Industrial and Applied Mathematics
United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in