A Simple Algorithm for Minimum Cuts in Near-Linear Time.
Antonio Molina LovettBryce SandlundPublished in: CoRR (2019)
Keyphrases
- experimental evaluation
- worst case
- computational complexity
- optimal solution
- k means
- cost function
- computationally efficient
- expectation maximization
- theoretical analysis
- high accuracy
- computational cost
- estimation algorithm
- similarity measure
- classification algorithm
- optimization algorithm
- learning algorithm
- times faster
- convex hull
- recognition algorithm
- minimum length
- preprocessing
- objective function
- neural network
- simulated annealing
- dynamic programming
- clustering method
- tree structure
- np hard
- significant improvement
- search algorithm
- square error