WAOA 2005 Workshop Approximation and Online Algorithms
 |  |
Wall of Fame | Most Viewed WAOA-2005 Paper
WAOA
2005
Springer
13 years 9 months ago
2005
Springer
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...
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.
| Id | Read | Views | Title | Status |
|---|---|---|---|---|
| 1 |  | 177 | ||
| 2 | | 170 | ||
| 3 | | 163 | ||
| 4 | | 161 | ||
| 5 | | 152 | ||
| 6 | | 142 | ||
| 7 | | 127 | ||
| 8 | | 113 | ||
| 9 | | 112 | ||
| 10 | | 104 | ||
| 11 | | 92 | ||
| 12 | | 92 | ||
| 13 | | 90 | ||
| 14 | | 89 | ||
| 15 | | 86 | ||
| 16 | | 84 | ||
| 17 | | 77 |