Tree-Robinson dissimilarities

DOI10.1007/S00026-026-00829-7MaRDI QIDQ7363770zbMATH OpenFDO

Authors Pascal Préa

Publication date 30 September 2026

Published in Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00026-026-00829-7

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Cites work

• An optimal algorithm to recognize Robinsonian dissimilarities
• From hypertrees to arboreal quasi-ultrametrics
• scientific article; zbMATH DE number 4213811 (Why is no real title available?)
• Modules in Robinson Spaces
• NP-hard approximation problems in overlapping clustering.
• Recognising permuted Demidenko matrices
• Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances
• Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices

This page was built for publication: Tree-Robinson dissimilarities

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