WAOA   2005 Workshop Approximation and Online Algorithms
Wall of Fame | Most Viewed WAOA-2005 Paper
177views Algorithms» more  WAOA 2005»
14 years 27 days ago
Approximation and Complexity of k-Splittable Flows
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
Ronald Koch, Martin Skutella, Ines Spenke
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.
1Download preprint from source177
2Download preprint from source170
3Download preprint from source163
4Download preprint from source161
5Download preprint from source152
6Download preprint from source142
7Download preprint from source127
8Download preprint from source113
9Download preprint from source112
10Download preprint from source104
11Download preprint from source92
12Download preprint from source92
13Download preprint from source90
14Download preprint from source89
15Download preprint from source86
16Download preprint from source84
17Download preprint from source77