Fast hierarchical clustering and other applications of dynamic closest pairs

DOI10.1145/351827.351829zbMath1071.68548arXivcs/9912014OpenAlexW3122925083MaRDI QIDQ5463394

David Eppstein

Publication date: 4 August 2005

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/9912014

zbMATH Keywords

TSPquadtreeGröbner basesmatchinghierarchical clusteringagglomerative clusteringnearest-neighbor heuristicconga line data structure

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Data structures (68P05)

Related Items (5)

Fast indefinite multi-point (IMP) clustering ⋮ Optimal implementations of UPGMA and other common clustering algorithms ⋮ Straight Skeletons of Three-Dimensional Polyhedra ⋮ Minimax and Minimax Projection Designs Using Clustering ⋮ The distribution of edge-frequencies computed with frequency quadrilaterals for traveling salesman problem

This page was built for publication: Fast hierarchical clustering and other applications of dynamic closest pairs