An Algorithm for Computing Cutpoints in Finite Metric Spaces
- 108 Downloads
The theory of the tight span, a cell complex that can be associated to every metric D, offers a unifying view on existing approaches for analyzing distance data, in particular for decomposing a metric D into a sum of simpler metrics as well as for representing it by certain specific edge-weighted graphs, often referred to as realizations of D. Many of these approaches involve the explicit or implicit computation of the so-called cutpoints of (the tight span of) D, such as the algorithm for computing the “building blocks” of optimal realizations of D recently presented by A. Hertz and S. Varone. The main result of this paper is an algorithm for computing the set of these cutpoints for a metric D on a finite set with n elements in O(n3) time. As a direct consequence, this improves the run time of the aforementioned O(n6)-algorithm by Hertz and Varone by “three orders of magnitude”.
KeywordsMetric Cutpoint Realization Tight span Decomposition Block
Unable to display preview. Download preview PDF.
- DRESS, A., HUBER, K. T., KOOLEN, J., and MOULTON, V. (2007), “An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces”, in International Conference on Combinatorial Optimization and Applications (COCOA), volume 4616 of LNCS, eds. A.W.M. Dress, Y. Xu, B, Zhu, Springer, pp. 4–10.Google Scholar
- KURATOWSKI, C. (1935), “Quelques problèmes concernant les espaces métriques nons éperables”, Fundamenta Mathematicae, 25, 534–545.Google Scholar
- WEST, D. (1996), Introduction to Graph Theory, Prentice Hall.Google Scholar