Approximate solution - Search Results - UAB Digital Repository of Documents

Search collections:

Sort by:	Display results:	Output format:

Results overview: Found 1 records in 0.02 seconds.
Articles, 1 records found

Articles	1 records found

16 p, 827.8 KB

Fast deterministic approximation for the multicommodity flow problem / Radzik, Tomasz
In this paper we consider an optimization version of the multicommodity flow problem which is known as the maximum concurrent flow problem. We show that an approximate solution to this problem can be computed deterministically using O (k((Epsilon)^-2 + log k) log n) 1-commodity minimum-cost flow computations, where k is the number of commodities, n is the number of nodes, and (Epsilon) is the desired precision. [...]
1997
Mathematical Programming, vol. 78 n. 1 (1997) p. 43-58

UAB restricted access

Detailed record -

Interested in being notified about new results for this query?
Set up a personal email alert or subscribe to the RSS feed.