An O ( n ) -approximation algorithm for directed sparsest cut
We give an O ( n ) -approximation algorithm for the Sparsest Cut Problem on directed graphs. A naïve reduction from Sparsest Cut to Minimum Multicut would only give an approximation ratio of O ( n log D ) , where D is the sum of the demands. We obtain the improvement using a novel LP-rounding method...
Gespeichert in:
| Veröffentlicht in: | Information processing letters 2006-02, Vol.97 (4), p.156-160 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | We give an
O
(
n
)
-approximation algorithm for the Sparsest Cut Problem on directed graphs. A naïve reduction from Sparsest Cut to Minimum Multicut would only give an approximation ratio of
O
(
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. |
|---|---|
| ISSN: | 0020-0190 1872-6119 |
| DOI: | 10.1016/j.ipl.2005.10.005 |