On the max-flow min-cut ratio for directed multicommodity flows

We present a pure combinatorial problem whose solution determines max-flow min-cut ratio for directed multicommodity flows. In addition, this combinatorial problem has applications in improving the approximation factor of the greedy algorithm for the maximum edge disjoint path problem. More precisel...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Theoretical computer science 2006-03, Vol.352 (1), p.318-321
Hauptverfasser:	Hajiaghayi, M.T, Leighton, Tom
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Approximation algorithm Combinatorics Combinatorics. Ordered structures Computer science control theory systems Directed graph Exact sciences and technology Graph theory Information retrieval. Graph Mathematics Multicommodity flow and multicut Sciences and techniques of general use Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We present a pure combinatorial problem whose solution determines max-flow min-cut ratio for directed multicommodity flows. In addition, this combinatorial problem has applications in improving the approximation factor of the greedy algorithm for the maximum edge disjoint path problem. More precisely, our upper bound improves the approximation factor for this problem to O ( n 3 / 4 ) .
ISSN:	0304-3975 1879-2294
DOI:	10.1016/j.tcs.2005.10.037