A general approach for incremental approximation and hierarchical clustering

DOI10.1145/1109557.1109684zbMath1192.68978OpenAlexW4235797326MaRDI QIDQ3583429

Chandrashekhar Nagarajan, Guolong Lin, Rajaraman Rajmohan, David P. Williamson

Publication date: 16 August 2010

Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Algorithms in computer science (68W99)

Related Items (8)

On hierarchical diameter-clustering and the supplier problem ⋮ An incremental version of the \(k\)-center problem on boundary of a convex polygon ⋮ Better bounds for incremental medians ⋮ An Optimal Incremental Algorithm for Minimizing Lateness with Rejection ⋮ An Improved Competitive Algorithm for One-Dimensional Incremental Median Problem ⋮ Incremental medians via online bidding ⋮ Better Bounds for Incremental Medians ⋮ Randomized algorithms for online bounded bidding

This page was built for publication: A general approach for incremental approximation and hierarchical clustering