A heuristic for the p-center problem in graphs
Discrete Applied Mathematics
Robust regression and outlier detection
Robust regression and outlier detection
Optimal algorithms for approximate clustering
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Efficient collision detection for moving polyhedra
Proceedings of the eleventh annual symposium on Computational geometry
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Fast algorithms for collision and proximity problems involving moving geometric objects
Computational Geometry: Theory and Applications
Proximity problems on moving points
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Kinetic data structures: a state of the art report
WAFR '98 Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics : the algorithmic perspective: the algorithmic perspective
Data structures for mobile data
Journal of Algorithms
Algorithms for facility location problems with outliers
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Introduction to Algorithms
Navigating nets: simple algorithms for proximity search
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Discrete & Computational Geometry
Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs
ACM Transactions on Algorithms (TALG)
Searching dynamic point sets in spaces with bounded doubling dimension
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Automated Generation of Context-Aware Tests
ICSE '07 Proceedings of the 29th international conference on Software Engineering
A constant factor approximation algorithm for k-median clustering with outliers
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Deformable spanners and applications
Computational Geometry: Theory and Applications
Approximate range searching: The absolute model
Computational Geometry: Theory and Applications
Field test of nonintrusive traffic detection technologies
Mathematical and Computer Modelling: An International Journal
Simultaneous motion estimation and segmentation
IEEE Transactions on Image Processing
Unsupervised video segmentation based on watersheds and temporal tracking
IEEE Transactions on Circuits and Systems for Video Technology
NeTra-V: toward an object-based video representation
IEEE Transactions on Circuits and Systems for Video Technology
Proximity algorithms for nearly-doubling spaces
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Kinetic 2-centers in the black-box model
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.02 |
Two complications frequently arise in real-world applications, motion and the contamination of data by outliers. We consider a fundamental clustering problem, the k-center problem, within the context of these two issues. We are given a finite point set S of size n and an integer k. In the standard k-center problem, the objective is to compute a set of k center points to minimize the maximum distance from any point of S to its closest center, or equivalently, the smallest radius such that S can be covered by k disks of this radius. In the discrete k-center problem the disk centers are drawn from the points of S, and in the absolute k-center problem the disk centers are unrestricted. We generalize this problem in two ways. First, we assume that points are in continuous motion, and the objective is to maintain a solution over time. Second, we assume that some given robustness parameter 0