Journal
INFORMATION PROCESSING LETTERS
Volume 97, Issue 4, Pages 156-160Publisher
ELSEVIER
DOI: 10.1016/j.ipl.2005.10.005
Keywords
approximation algorithms; directed graphs; sparsest cut; multicommodity flow
Categories
Ask authors/readers for more resources
We give an O (root n)-approximation algorithm for the Sparsest Cut Problem on directed graphs. A naive reduction from Sparsest Cut to Minimum Multicut would only give an approximation ratio of O(root n log D), where D is the sum of the demands. We obtain the improvement using a novel LP-rounding method for fractional Sparsest Cut, the dual of Maximum Concurrent Flow. (c) 2005 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available