Antipodal Metrics and Split Systems
@article{Dress2002AntipodalMA, title={Antipodal Metrics and Split Systems}, author={Andreas W. M. Dress and Katharina T. Huber and Vincent Moulton}, journal={Eur. J. Comb.}, year={2002}, volume={23}, pages={187-200} }
Recall that a metric d on a finite set X is called antipodal if there exists a map ?: X?X: x?? __x so that d(x, __ x) =d(x,y ) +d(y, __ x) holds for all x,y?X. Antipodal metrics canonically arise as metrics induced on specific weighted graphs, although their abundance becomes clearer in light of the fact that any finite metric space can be isometrically embedded in a more or less canonical way into an antipodal metric space called its full antipodal extension.In this paper, we examine in some…
5 Citations
The Tight Span of an Antipodal Metric Space:
Part II—Geometrical Properties
- MathematicsDiscret. Comput. Geom.
- 2004
The concept of cell-decomposability for a metrics is introduced and it is proved that the tight span of such a metric is the union of cells, each of which is isometric and polytope isomorphic to the Tight span of some antipodal metric.
The tight span of an antipodal metric space - Part I: : Combinatorial properties
- MathematicsDiscret. Math.
- 2005
On the structure of the tight-span of a totally split-decomposable metric
- Mathematics
- 2006
The tight-span of a finite metric space is a polytopal complex with a structure that reflects properties of the metric. In this paper we consider the tight-span of a totally split-decomposable…
On the structure of the tight-span of a totally split-decomposable metric
- MathematicsEur. J. Comb.
- 2006
T-Theory Applications to Online Algorithms for the Server Problem
- Computer ScienceArXiv
- 2006
A previously unpublished 3-competitiveness proof, using T-theory, for the Harmonic algorithm for two servers is presented, and a number of known k-server results are restated using the established terminology of T- theory.
References
SHOWING 1-10 OF 25 REFERENCES
Totally Split-Decomposable Metrics of Combinatorial Dimension Two
- Mathematics
- 2001
Abstract. The combinatorial dimension of a metric space (X; d), denoted by dimcombin(d), arises naturally in the subject of T-theory, and, in case X is finite, corresponds with the (topological)…
An Exceptional Split Geometry
- Mathematics
- 2000
Abstract. In view of results obtained in split decomposition theory, it is of some interest to investigate the structure of weakly compatible split systems. A particular class of such split systems —…
On circuits and pancyclic line graphs
- MathematicsJ. Graph Theory
- 1986
It is shown that the bound n - 1 - p(n) can be decreased to (2n + 1)/3 if G is connected and bridgeless, which is necessary for G to have a spanning closed trail.
Handbook of Combinatorics
- Mathematics
- 1995
Part 1 Structures: graphs - basic graph theory - paths and circuits, J.A. Bondy, connectivity and network flows, A. Frank, matchings and extensions, W.R. Pulleyblank, colouring, stable sets and…
Geometry of cuts and metrics
- ArtAlgorithms and combinatorics
- 1997
This book draws from the interdisciplinarity of these fields as it gathers methods and results from polytope theory, geometry of numbers, probability theory, design and graph theory around two objects, cuts and metrics.
Six Points Suffice: How to Check for Metric Consistency
- Mathematics, Computer ScienceEur. J. Comb.
- 2001
This paper gives a six-point characterization of consistent metrics amongst the totally decomposable metrics, and indicates that these metrics are of fundamental importance in the analysis of distance tables.
Hereditarily Optimal Realizations: Why are they Relevant in Phylogenetic Analysis, and how does one Compute them
- Computer Science
- 2001
Hereditarily optimal realizations are defined, some of their properties are discussed, and it is indicated in particular why, due to recent results on the so-called T-construction of a metric space, it is a straight forward task to compute these realizations for a large class of phylogentically relevant metrics.