The structure of circular decomposable metrics

DOI10.1007/3-540-61680-2_77zbMath1380.90234OpenAlexW1583471982MaRDI QIDQ4595510

George Christopher, Michael A. Trick, Martin Farach

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)

Related Items (12)

Efficiently solvable special cases of hard combinatorial optimization problems ⋮ Order distances and split systems ⋮ Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem ⋮ The three-dimensional matching problem in kalmanson matrices ⋮ Balancing profits and costs on trees ⋮ The multi-stripe travelling salesman problem ⋮ Affine and projective tree metric theorems ⋮ Algorithms for the universal and a priori TSP ⋮ A New Tractable Case of the QAP with a Robinson Matrix ⋮ The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure ⋮ Traveling salesman games with the Monge property ⋮ Quasi-ultrametrics and their \(2\)-ball hypergraphs

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