Optimal algorithms for complete linkage clustering in \(d\) dimensions
type: Item
instance of: scholarly article
title: Optimal algorithms for complete linkage clustering in \(d\) dimensions
zbMATH Open document ID: 1016.68084
DOI: 10.1016/S0304-3975(01)00239-0
author: Drago Krznaric
author: Christos Levcopoulos
published in: Theoretical Computer Science
publication date: 2002-08-13T00:00:00Z
Mathematics Subject Classification ID: 68T10
Mathematics Subject Classification ID: 68U10
zbMATH DE Number: 1780601
zbMATH Keywords: complete linkage clustering
zbMATH Keywords: hierarchical clustering
zbMATH Keywords: multidimensional
zbMATH Keywords: optimal algorithms
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
cites work: Q4867182
cites work: Q4945505
cites work: Efficient algorithms for agglomerative hierarchical clustering methods
cites work: An efficient algorithm for a complete link method
cites work: Fast algorithms for complete linkage clustering
cites work: Q4721426
cites work: Q3694703
full work available at URL: s0304-3975(01)00239-0
OpenAlex ID: W2091146986
description: scientific article; zbMATH DE number 1780601