scientific article; zbMATH DE number 7204478

DOI10.4230/LIPICS.ICALP.2017.26zbMATH Open1441.68165arXiv1605.04651MaRDI QIDQ5111356FDOQ5111356

Yihan Sun, Guy E. Blelloch, Yan Gu

Publication date: 27 May 2020

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

Title of this publication is not available (Why is that?)

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

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)

Cited In (7)

• 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
• Optimal one-page tree embeddings in linear time
• Covering metric spaces by few trees
• Title not available (Why is that?)

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)