A Random Polynomial Time Algorithm for Well-rounding Convex Bodies.
Ulrich FaigleNoud GademannWalter KernPublished in: Discret. Appl. Math. (1995)
Keyphrases
- worst case
- experimental evaluation
- preprocessing
- computational complexity
- globally optimal
- randomly generated
- computational cost
- high accuracy
- optimization algorithm
- times faster
- theoretical analysis
- expectation maximization
- approximation algorithms
- recognition algorithm
- dynamic programming
- cost function
- approximation ratio
- learning algorithm
- piecewise linear
- convergence rate
- strongly polynomial
- detection algorithm
- segmentation algorithm
- np hard
- k means
- knapsack problem
- particle swarm optimization
- linear programming
- special case
- significant improvement
- semidefinite programming
- optimal solution