scientific article; zbMATH DE number 7204478

DOI10.4230/LIPICS.ICALP.2017.26MaRDI QIDQ5111356zbMATH OpenFDO

Authors Guy E. Blelloch, Yan Gu, Yihan Sun

Publication date 27 May 2020

Full work available at URL https://arxiv.org/abs/1605.04651

zbMATH Keywords

graph algorithmmetric embeddingssingle-source shortest-pathsprobabilistic tree embeddings

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Approximation algorithms (68W25) Metric embeddings as related to computational problems and algorithms (68R12)

Recommendations

• Parallel metric tree embedding based on an algebraic view on Moore-Bellman-Ford
• Approximation algorithms for embedding general metrics into trees
• A tight bound on approximating arbitrary metrics by tree metrics
• A tight bound on approximating arbitrary metrics by tree metrics
• Multiembedding of Metric Spaces

Cited in

(12)

• Covering Metric Spaces by Few Trees
• Graph Embedding through Random Walk for Shortest Paths Problems
• On the Facility Location Problem in Online and Dynamic Models.
• Largest Weight Common Subtree Embeddings with Distance Penalties
• A tight upper bound on the probabilistic embedding of series-parallel graphs
• Optimal one-page tree embeddings in linear time
• Covering metric spaces by few trees
• Fast C-K-R partitions of sparse graphs
• Efficient distributed approximation algorithms via probabilistic tree embeddings
• Efficient distributed approximation algorithms via probabilistic tree embeddings
• scientific article; zbMATH DE number 6378173 (Why is no real title available?)
• Parallel metric tree embedding based on an algebraic view on Moore-Bellman-Ford

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111356)