Approximation algorithm for solving the 1-line Steiner tree problem with minimum number of Steiner points.
Suding LiuPublished in: Optim. Lett. (2024)
Keyphrases
- constant factor
- computational complexity
- minimum distance
- randomized algorithm
- k means
- np hard
- dynamic programming
- approximation ratio
- preprocessing
- computational cost
- optimization algorithm
- learning algorithm
- segmentation algorithm
- polynomial time approximation
- maximum distance
- convex hull
- steiner tree
- search space
- search algorithm
- error bounds
- average distance
- error tolerance
- finite set of points
- polygonal approximation
- approximation error
- cluster centers
- endpoints
- knapsack problem
- detection algorithm
- lower bound
- similarity measure