The paper presents the first fully dynamic data structures for maintaining pointwise approximate hierarchical k-center and diameter k-clustering on a discrete Euclidean grid, with polylogarithmic updates in constant dimension and sublinear deletion time in high dimension.
5036--5044
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Fully dynamic hierarchical diameter k-clustering and k-center
The paper presents the first fully dynamic data structures for maintaining pointwise approximate hierarchical k-center and diameter k-clustering on a discrete Euclidean grid, with polylogarithmic updates in constant dimension and sublinear deletion time in high dimension.