Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms

This paper establishes max-flow min-cut theorems for several important classes of multicommodity flow problems. In particular, it shows that for any n-node multicommodity flow problem with uniform demands, the max-flow for the problem is within an O(log n) factor of the upper bound implied by the mi...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of the ACM 1999-11, Vol.46 (6), p.787-832
Hauptverfasser:	LEIGHTON, TOM, RAO, SATISH
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Approximation Approximation theory Computer programming Computer science Graph theory Studies Systems design
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!