The structure of circular decomposable metrics

DOI10.1007/3-540-61680-2_77MaRDI QIDQ4595510zbMATH OpenOpenAlexFDO

Authors George Christopher, Martin Farach, Michael A. Trick

Publication date 5 December 2017

Published in Algorithms — ESA '96 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61680-2_77

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27)

Recommendations

• A note on circular decomposable metrics
• Metrics and undirected cuts
• A canonical decomposition theory for metrics on a finite set
• The Steiner tree problem in Kalmanson matrices and in circulant matrices
• Characterizing cell-decomposable metrics

Cited in

(16)

• Efficiently solvable special cases of hard combinatorial optimization problems
• A note on circular decomposable metrics
• Quasi-ultrametrics and their \(2\)-ball hypergraphs
• Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem
• The multi-stripe travelling salesman problem
• The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure
• Traveling salesman games with the Monge property
• Affine and projective tree metric theorems
• Order distances and split systems
• The three-dimensional matching problem in kalmanson matrices
• Balancing profits and costs on trees
• A new tractable case of the QAP with a Robinson matrix
• Vietoris-Rips metric thickenings of the circle
• Distinguishing phylogenetic level-2 networks with quartets and inter-taxon quartet distances
• Decomposition of acyclic normal currents in a metric space
• Algorithms for the universal and a priori TSP

This page was built for publication: The structure of circular decomposable metrics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4595510)