Faster and simpler algorithms for multicommodity flow and otherfractional packing problems
Garg, N.
Konemann, J.
Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., New Delhi;
This paper appears in: Foundations of Computer Science, 1998. Proceedings.39th Annual Symposium on
Publication Date: 8-11 Nov 1998
On page(s): 300-309
Meeting Date: 11/08/1998 - 11/11/1998
Location: Palo Alto, CA, USA
ISBN: 0-8186-9172-7
References Cited: 17
INSPEC Accession Number: 6128796
Digital Object Identifier: 10.1109/SFCS.1998.743463
Current Version Published: 2002-08-06
Abstract
This paper considers the problem of designing fast, approximate,
combinatorial algorithms for multicommodity flows and other fractional
packing problems. We provide a different approach to these problems
which yields faster and much simpler algorithms. Our approach also
allows us to substitute shortest path computations for min-cost flow
computations in computing maximum concurrent flow and min-cost
multicommodity flow; this yields much faster algorithms when the number
of commodities is large
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
