A Simpler and Parallelizable O(√log n)-approximation Algorithm for Sparsest Cut.
Vladimir KolmogorovPublished in: SPAA (2024)
Keyphrases
- learning algorithm
- computational complexity
- times faster
- cost function
- worst case
- improved algorithm
- detection algorithm
- expectation maximization
- optimization algorithm
- computational cost
- objective function
- error bounds
- simulated annealing
- k means
- preprocessing
- experimental evaluation
- dynamic programming
- np hard
- tree structure
- matching algorithm
- closed form
- significant improvement
- approximation ratio