On hierarchical diameter-clustering and the supplier problem

DOI10.1007/S00224-009-9186-6zbMATH Open1191.68861OpenAlexW1981622620MaRDI QIDQ839643FDOQ839643

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

Recommendations

• On Hierarchical Diameter-Clustering, and the Supplier Problem
• Approximation algorithms for hierarchical location problems
• Approximation algorithms for hierarchical location problems
• Clustering to minimize the sum of cluster diameters
• scientific article; zbMATH DE number 2089373

zbMATH Keywords

approximation algorithmhierarchical clusteringonline algorithm

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Cites Work

• Finding Groups in Data
• Title not available (Why is that?)
• Title not available (Why is that?)
• Clustering to minimize the maximum intercluster distance
• A Best Possible Heuristic for the k-Center Problem
• Incremental Clustering and Dynamic Information Retrieval
• Performance guarantees for hierarchical clustering
• Oblivious Medians Via Online Bidding
• A general approach for incremental approximation and hierarchical clustering

Cited In (3)

• A hybrid approach for supplier cluster analysis
• A clustering algorithm for supplier base management
• Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints

Uses Software

• clusfind

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

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