Sciweavers

Share
SIAMCOMP   1998
Wall of Fame | Most Viewed SIAMCOMP-1998 Paper
SIAMCOMP
1998
176views more  SIAMCOMP 1998»
8 years 4 months ago
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This im...
Yonatan Aumann, Yuval Rabani
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
IdReadViewsTitleStatus
1Download preprint from source176
2Download preprint from source168
3Download preprint from source162
4Download preprint from source141
5Download preprint from source138
6Download preprint from source137
7Download preprint from source126
8Download preprint from source125
9Download preprint from source124
10Download preprint from source118
11Download preprint from source117
12Download preprint from source114
13Download preprint from source114
14Download preprint from source113
15Download preprint from source111
16Download preprint from source108
17Download preprint from source102
18Download preprint from source99
19Download preprint from source98
20Download preprint from source96
21Download preprint from source93
22Download preprint from source92
23Download preprint from source86
24Download preprint from source85
25Download preprint from source68
books