An O(sqrt(n))-approximation algorithm for directed sparsest cut.
Mohammad Taghi HajiaghayiHarald RäckePublished in: Inf. Process. Lett. (2006)
Keyphrases
- times faster
- preprocessing
- detection algorithm
- optimization algorithm
- search space
- k means
- matching algorithm
- similarity measure
- improved algorithm
- computational cost
- high accuracy
- classification algorithm
- tree structure
- clustering method
- expectation maximization
- worst case
- dynamic programming
- recognition algorithm
- cost function
- computational complexity
- learning algorithm
- error bounds
- polygonal approximation
- monte carlo
- theoretical analysis
- simulated annealing
- experimental evaluation
- np hard
- optimal solution
- objective function