An approximation algorithm for the k-generalized Steiner forest problem.
Jiawen GaoSuogang GaoWen LiuWeili WuDing-Zhu DuBo HouPublished in: Optim. Lett. (2021)
Keyphrases
- high accuracy
- experimental evaluation
- optimization algorithm
- closed form
- improved algorithm
- computational cost
- significant improvement
- times faster
- search space
- k means
- computational complexity
- np hard
- approximation ratio
- objective function
- theoretical analysis
- error bounds
- computationally efficient
- cost function
- probabilistic model
- data sets
- learning algorithm
- maximum likelihood
- preprocessing
- search algorithm
- polygonal approximation
- error tolerance
- classification algorithm
- ant colony optimization
- clustering method
- segmentation algorithm
- simulated annealing
- worst case
- least squares
- optimal solution
- similarity measure