On the Max-Flow Min-Cut Ratio for Directed Multicommodity Flows
| dc.date.accessioned | 2005-12-12T23:22:48Z | |
| dc.date.accessioned | 2018-11-24T10:23:47Z | |
| dc.date.available | 2005-12-12T23:22:48Z | |
| dc.date.available | 2018-11-24T10:23:47Z | |
| dc.date.issued | 2003-07-05 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/29829 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/29829 | |
| dc.description.abstract | We give 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 Greedy algorithm for maximum edge disjoint path problem. More precisely, our upper bound improves the approximation factor for this problem to O(n^{3/4}). Finally, we demonstrate how even for very simple graphs the aforementioned ratio might be very large. | |
| dc.format.extent | 5 p. | |
| dc.format.extent | 7867417 bytes | |
| dc.format.extent | 389570 bytes | |
| dc.language.iso | en_US | |
| dc.title | On the Max-Flow Min-Cut Ratio for Directed Multicommodity Flows |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| MIT-CSAIL-TR-2003-002.pdf | 389.5Kb | application/pdf | View/ |
| MIT-CSAIL-TR-2003-002.ps | 7.867Mb | application/postscript | View/ |