Fully dynamic clustering and diversity maximization in doubling metrics

by   Paolo Pellizzoni, et al.

We present approximation algorithms for some variants of center-based clustering and related problems in the fully dynamic setting, where the pointset evolves through an arbitrary sequence of insertions and deletions. Specifically, we target the following problems: k-center (with and without outliers), matroid-center, and diversity maximization. All algorithms employ a coreset-based strategy and rely on the use of the cover tree data structure, which we crucially augment to maintain, at any time, some additional information enabling the efficient extraction of the solution for the specific problem. For all of the aforementioned problems our algorithms yield (α+ε)-approximations, where α is the best known approximation attainable in polynomial time in the standard off-line setting (except for k-center with z outliers where α = 2 but we get a (3+ε)-approximation) and ε>0 is a user-provided accuracy parameter. The analysis of the algorithms is performed in terms of the doubling dimension of the underlying metric. Remarkably, and unlike previous works, the data structure and the running times of the insertion and deletion procedures do not depend in any way on the accuracy parameter ε and, for the two k-center variants, on the parameter k. For spaces of bounded doubling dimension, the running times are dramatically smaller than those that would be required to compute solutions on the entire pointset from scratch. To the best of our knowledge, ours are the first solutions for the matroid-center and diversity maximization problems in the fully dynamic setting.


page 1

page 2

page 3

page 4


Fully Dynamic k-Center Clustering in Doubling Metrics

In the k-center clustering problem, we are given a set of n points in a ...

On fully dynamic constant-factor approximation algorithms for clustering problems

Clustering is an important task with applications in many fields of comp...

Improved approximation algorithms for two Euclidean k-Center variants

The k-Center problem is one of the most popular clustering problems. Aft...

Distributed k-Clustering for Data with Heavy Noise

In this paper, we consider the k-center/median/means clustering with out...

Fully dynamic hierarchical diameter k-clustering and k-center

We develop dynamic data structures for maintaining a hierarchical k-cent...

Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries

In fully dynamic clustering problems, a clustering of a given data set i...

Diversity maximization in doubling metrics

Diversity maximization is an important geometric optimization problem wi...

Please sign up or login with your details

Forgot password? Click here to reset