On hierarchical diameter-clustering and the supplier problem

DOI10.1007/s00224-009-9186-6zbMath1191.68861OpenAlexW1981622620MaRDI QIDQ839643

Aparna Das, Claire Kenyon-Mathieu

Publication date: 2 September 2009

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-009-9186-6

zbMATH Keywords

hierarchical clusteringapproximation algorithmonline algorithm

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Related Items (1)

Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints

Uses Software

• clusfind

Cites Work

• Unnamed Item
• Unnamed Item
• Clustering to minimize the maximum intercluster distance
• Performance guarantees for hierarchical clustering
• Oblivious Medians Via Online Bidding
• A general approach for incremental approximation and hierarchical clustering
• A Best Possible Heuristic for the k-Center Problem
• Finding Groups in Data
• Incremental Clustering and Dynamic Information Retrieval

This page was built for publication: On hierarchical diameter-clustering and the supplier problem