Squarepants in a tree

DOI10.1145/1541885.1541890zbMath1298.68278MaRDI QIDQ2930253

David Eppstein

Publication date: 18 November 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1541885.1541890

zbMATH Keywords

hierarchical clustering; approximation algorithm; hyperbolic geometry; minimum spanning tree; pants decomposition; sum of cluster sizes

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms

Related Items

Manhattan orbifolds, Discrete systolic inequalities and decompositions of triangulated surfaces