Online and dynamic embeddings of approximate ultrametrics
Abstract
References
Index Terms
- Online and dynamic embeddings of approximate ultrametrics
Recommendations
Reconstructing approximate tree metrics
PODC '07: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computingWe introduce a novel measure called ε-four-pointscondition (ε-4PC), which assigns a value ε ∈ [0,1] to every metric space quantifying how close the metric is to a tree metric. Data-sets taken from real Internet measurements indicate remarkable closeness ...
Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics
DISC '08: Proceedings of the 22nd international symposium on Distributed ComputingThe theoretical computer science community has traditionally used embeddings of finite metrics as a tool in designing approximation algorithms. Recently, however, there has been considerable interest in using metric embeddings in the context of ...
Low dimensional embeddings of ultrametrics
In this note we show that every n-point ultrametric embeds with constant distortion in lpO(log n) for every ∞ ≥ p ≥ 1. More precisely, we consider a special type of ultrametric with hierarchical structure called a k-hierarchically well-separated tree (k-...
Comments
Information & Contributors
Information
Published In
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Demonstration
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 106Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in