Trees and Euclidean metrics
- 1 January 1998
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 169-175
- https://doi.org/10.1145/276698.276726
Abstract
IntroductionThere has been a growing interest in finite metricspaces and their approximations. Such considerationshave proved useful in a number of graph algorithms[13], in clustering [11] and most recently in online computation[2, 3]. To study a given metric space, one seeksfirst an approximate metric from a better-understoodclass of metrics. Thus, approximations by l 1 metricsare instrumental in the study of multicommodity flowsInstitute of Computer Science, Hebrew University,...Keywords
This publication has 0 references indexed in Scilit: