Fast construction of nets in low dimensional metrics, and their applications
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
A fast k-means implementation using coresets
Proceedings of the twenty-second annual symposium on Computational geometry
Competitive algorithms for maintaining a mobile center
Mobile Networks and Applications
Proceedings of the twenty-fourth annual symposium on Computational geometry
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Geometric algorithms for optimal airspace design and air traffic controller workload balancing
Journal of Experimental Algorithmics (JEA)
On the complexity of approximation streaming algorithms for the k-center problem
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Approximation algorithm for the kinetic robust K-center problem
Computational Geometry: Theory and Applications
An entropy-based framework for dynamic clustering and coverage problems
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Road network reconstruction for organizing paths
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Smoothed analysis of left-to-right maxima with applications
ACM Transactions on Algorithms (TALG)
MOIST: a scalable and parallel moving object indexer with school tracking
Proceedings of the VLDB Endowment
International Journal of Intelligent Information and Database Systems
Kinetic 2-centers in the black-box model
Proceedings of the twenty-ninth annual symposium on Computational geometry
Net and prune: a linear time algorithm for euclidean distance problems
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
A framework of traveling companion discovery on trajectory data streams
ACM Transactions on Intelligent Systems and Technology (TIST) - Special Section on Intelligent Mobile Knowledge Discovery and Management Systems and Special Issue on Social Web Mining
| Hi-index | 0.00 |
Given a set of moving points in ℝd, we show how to cluster them in advance, using a small number of clusters, so that at any time this static clustering is competitive with the optimal k-center clustering at that time. The advantage of this approach is that it avoids updating the clustering as time passes. We also show how to maintain this static clustering efficiently under insertions and deletions.To implement this static clustering efficiently, we describe a simple technique for speeding up clustering algorithms and apply it to achieve faster clustering algorithms for several problems. In particular, we present a linear time algorithm for computing a 2-approximation to the k-center clustering of a set of n points in ℝd. This slightly improves the algorithm of Feder and Greene, that runs in Θ(n log k) time (which is optimal in the algebraic decision tree model).