A (3+ε)-approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower bounds.
Moritz BuchemKatja EttmayrHugo Kooki Kasuya RosadoAndreas WiesePublished in: CoRR (2023)
Keyphrases
- objective function
- lower bound
- dynamic programming
- np hard
- computational complexity
- search space
- times faster
- closed form
- detection algorithm
- upper and lower bounds
- simulated annealing
- convergence rate
- noisy data
- segmentation algorithm
- worst case
- k means
- approximation ratio
- learning algorithm
- memory efficient
- outlier removal
- lower and upper bounds
- probabilistic model
- cost function
- evolutionary algorithm
- clustering algorithm