An experimental evaluation of incremental and hierarchical k-median algorithms

DOI10.1145/2543628zbMATH Open1365.68471OpenAlexW2083723353MaRDI QIDQ5266539FDOQ5266539

Authors: Chandrashekhar Nagarajan, David P. Williamson 

Publication date: 16 June 2017

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

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

Recommendations

• A general approach for incremental approximation and hierarchical clustering
• Algorithms – ESA 2004
• Incremental algorithms for facility location and \(k\)-median
• Better Bounds for Incremental Medians
• A \(k\)-median algorithm with running time independent of data size

zbMATH Keywords

hierarchical clusteringapproximation algorithmsmedian problems

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms (68W40) Approximation algorithms (68W25) Discrete location and assignment (90B80)

Cited In (1)

• A general approach for incremental approximation and hierarchical clustering

This page was built for publication: An experimental evaluation of incremental and hierarchical \(k\)-median algorithms

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