Building Fences Straight and High: An Optimal Algorithm for Finding the Maximum Length You Can Cut k Times from Given Sticks.
Raphael ReitzigSebastian WildPublished in: Algorithmica (2018)
Keyphrases
- dynamic programming
- learning algorithm
- times faster
- np hard
- worst case
- computationally efficient
- globally optimal
- probabilistic model
- optimal solution
- high efficiency
- search space
- k means
- detection algorithm
- optimization algorithm
- space complexity
- expectation maximization
- closed form
- segmentation algorithm
- theoretical analysis
- neural network
- simulated annealing
- experimental evaluation
- objective function
- linear programming
- high accuracy
- path planning
- computational cost
- convex hull
- computational complexity
- search algorithm
- minimum distance
- finding optimal
- optimality criterion
- minimum length