Towards an $O(\sqrt[3]{\log n})$-Approximation Algorithm for {\sc Balanced Separator}
Manjish PalPublished in: CoRR (2009)
Keyphrases
- worst case
- detection algorithm
- times faster
- high accuracy
- learning algorithm
- convergence rate
- k means
- computational cost
- improved algorithm
- dynamic programming
- np hard
- preprocessing
- cost function
- optimization algorithm
- experimental evaluation
- genetic algorithm
- simulated annealing
- significant improvement
- convex hull
- computational complexity
- similarity measure
- polynomial time approximation
- approximation schemes