42 search results - page 3 / 9 » A Simple Local-Control Approximation Algorithm for Multicomm... |
IPCO
1998
13 years 8 months ago
1998
FOCS
1998
IEEE
13 years 11 months ago
1998
IEEE
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different ap...
ESA
2003
Springer
14 years 21 days ago
2003
Springer
RANDOM
2001
Springer
13 years 12 months ago
2001
Springer
We study integrated prefetching and caching in single and parallel disk systems. A recent approach used linear programming to solve the problem. We show that integrated prefetching...
SIAMCOMP
1998
13 years 7 months ago
1998
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...