An O(n)-approximation algorithm for directed sparsest cut

Authors:
Mohammad Taghi Hajiaghayi;Harald Räcke
Affiliations:
Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, 32 Vassar Street, Cambridge, MA 02139, USA;School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA
Venue:
Information Processing Letters
Year:
2006

Citing 9
Cited 4

Cut problems and their application to divide-and-conquer

Approximation algorithms for NP-hard problems
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms

Journal of the ACM (JACM)
Improved results for directed multicut

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating Directed Multicuts

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Graph decomposition and a greedy algorithm for edge-disjoint paths

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Expander flows, geometric embeddings and graph partitioning

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A Lower Bound On The Integrality Gap For Minimum Multicut In Directed Networks

Combinatorica
O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Greedy approximation algorithms for directed multicuts

Networks

Directed metrics and directed graph partitioning problems

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Oblivious routing on node-capacitated and directed graphs

ACM Transactions on Algorithms (TALG)
Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs

Networks
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.89

Visualization

Abstract

We give an O(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(nlogD), 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.