Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics

DOI10.1007/978-3-540-87779-0_11zbMath1161.68866OpenAlexW1481627627MaRDI QIDQ3540227

Michael Dinitz

Publication date: 20 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87779-0_11

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• On sparse spanners of weighted graphs
• Local Global Tradeoffs in Metric Embeddings
• Approximate distance oracles
• Local versus global properties of metric spaces
• Reconstructing approximate tree metrics

This page was built for publication: Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics