Computer Science – Data Structures and Algorithms
Scientific paper
2009-08-10
Computer Science
Data Structures and Algorithms
Scientific paper
This paper ties the line of work on algorithms that find an O(sqrt(log(n)))-approximation to the sparsest cut together with the line of work on algorithms that run in sub-quadratic time by using only single-commodity flows. We present an algorithm that simultaneously achieves both goals, finding an O(sqrt(log(n)/eps))-approximation using O(n^eps log^O(1) n) max-flows. The core of the algorithm is a stronger, algorithmic version of Arora et al.'s structure theorem, where we show that matching-chaining argument at the heart of their proof can be viewed as an algorithm that finds good augmenting paths in certain geometric multicommodity flow networks. By using that specialized algorithm in place of a black-box solver, we are able to solve those instances much more efficiently. We also show the cut-matching game framework can not achieve an approximation any better than Omega(log(n)/log log(n)) without re-routing flow.
No associations
LandOfFree
Breaking the Multicommodity Flow Barrier for sqrt(log(n))-Approximations to Sparsest Cut does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Breaking the Multicommodity Flow Barrier for sqrt(log(n))-Approximations to Sparsest Cut, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Breaking the Multicommodity Flow Barrier for sqrt(log(n))-Approximations to Sparsest Cut will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-120958