A simpler and parallelizable O(√log n)-approximation algorithm for Sparsest Cut.
Vladimir KolmogorovPublished in: CoRR (2023)
Keyphrases
- computational complexity
- experimental evaluation
- worst case
- learning algorithm
- dynamic programming
- matching algorithm
- k means
- computational cost
- improved algorithm
- error bounds
- cost function
- segmentation algorithm
- optimization algorithm
- theoretical analysis
- times faster
- closed form
- genetic algorithm
- significant improvement
- search space
- detection algorithm
- ant colony optimization
- expectation maximization
- high accuracy
- convergence rate
- recognition algorithm
- planar graphs