Approximation algorithm for the kinetic robust \(k\)-center problem (Q982946): Difference between revisions

A clustering algorithm is developed by generalizing the standard \(k\)-center problem within the context of kinetic data, assuming that the data points are in continuous motion and robust optimization in the presence of heterogeneous data and outliers. Since the \(k\)-center problem has exponential complexity in \(k\), the algorithm provides an approximation to the \(k\)-center problem. The authors give all the details and properties of the algorithm. Because the problem that the authors handle is very important and new, the performance of the algorithm should be test in real applications