Incremental Clustering and Dynamic Information Retrieval
From MaRDI portal
Publication:4651519
DOI10.1137/S0097539702418498zbMath1101.68605MaRDI QIDQ4651519
Tomás Feder, Chandra Chekuri, Moses Charikar, Rajeev Motwani
Publication date: 21 February 2005
Published in: SIAM Journal on Computing (Search for Journal in Brave)
incremental clustering; performance guarantee; agglomerative clustering; minimum diameter clustering; k-center; dynamic information retrieval
Related Items
On the Online Unit Clustering Problem, Approximation algorithms for hierarchical location problems, Better bounds on online unit clustering, Incremental list coloring of graphs, parameterized by conservation, Streaming with minimum space: an algorithm for covering by two congruent balls, An online 2-dimensional clustering problem with variable sized clusters, A randomized algorithm for online unit clustering, On hierarchical diameter-clustering and the supplier problem, An improved data stream algorithm for clustering, Online unit clustering: Variations on a theme, An improved algorithm for online unit clustering, The reverse greedy algorithm for the metric k-median problem, Online clustering with variable sized clusters, Adaptive evolutionary clustering, Online sum-radii clustering, COMPUTING k CENTERS OVER STREAMING DATA FOR SMALL k, Competitive Strategies for Online Clique Clustering, Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls