The Karger-Stein Algorithm is Optimal for k-cut.
Anupam GuptaEuiwoong LeeJason LiPublished in: CoRR (2019)
Keyphrases
- dynamic programming
- worst case
- learning algorithm
- theoretical analysis
- matching algorithm
- globally optimal
- optimal solution
- segmentation algorithm
- locally optimal
- improved algorithm
- k means
- recognition algorithm
- preprocessing
- experimental evaluation
- computational cost
- times faster
- probabilistic model
- classification algorithm
- detection algorithm
- high accuracy
- significant improvement
- path planning
- convergence rate
- weighting coefficients
- particle swarm optimization
- linear programming
- np hard
- cost function
- evolutionary algorithm
- lower bound
- objective function
- similarity measure