A (3 + ɛ)-approximation algorithm for the minimum sum of radii problem with outliers and extensions for generalized lower bounds.
Moritz BuchemKatja EttmayrHugo K. K. RosadoAndreas WiesePublished in: SODA (2024)
Keyphrases
- np hard
- learning algorithm
- lower bound
- objective function
- computational complexity
- preprocessing
- error bounds
- theoretical analysis
- approximation ratio
- detection algorithm
- worst case
- probabilistic model
- dynamic programming
- k means
- segmentation algorithm
- polygonal approximation
- upper bound
- genetic algorithm
- simulated annealing
- expectation maximization
- combinatorial optimization
- evolutionary algorithm
- average case
- memory efficient
- optimal solution
- randomized algorithm
- error tolerance