A 12/7-approximation algorithm for the discrete Bamboo Garden Trimming problem.
Martijn van EePublished in: Oper. Res. Lett. (2021)
Keyphrases
- cost function
- neural network
- learning algorithm
- times faster
- simulated annealing
- approximation ratio
- error bounds
- convex hull
- detection algorithm
- theoretical analysis
- experimental evaluation
- k means
- preprocessing
- computational complexity
- objective function
- np hard
- computational cost
- probabilistic model
- similarity measure
- polygonal approximation
- optimization algorithm
- optimal solution
- error tolerance
- approximation schemes
- computational geometry
- piecewise constant
- improved algorithm
- recognition algorithm
- monte carlo
- segmentation algorithm
- data sets
- worst case
- special case