An approximation algorithm for the cutting-sticks problem.
Jagadish MPublished in: Inf. Process. Lett. (2015)
Keyphrases
- dynamic programming
- times faster
- detection algorithm
- probabilistic model
- learning algorithm
- computational complexity
- worst case
- polynomial time approximation
- optimization algorithm
- computational cost
- search space
- optimal solution
- np hard
- approximation ratio
- high accuracy
- simulated annealing
- improved algorithm
- closed form
- convex hull
- neural network
- approximation methods
- recognition algorithm
- error bounds
- monte carlo
- preprocessing
- input data
- k means
- significant improvement