100 search results - page 9 / 20 » Approximation Algorithms for the Unsplittable Flow Problem |
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
Abstract—Network power consumption can be reduced considerably by adapting link data rates to their offered traffic loads. In this paper, we exploit how to leverage rate adaptat...
INFORMS
2008
13 years 7 months ago
2008
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
ECCV
2010
Springer
13 years 8 months ago
2010
Springer
Although the recent advances in the sparse representations of images have achieved outstanding denosing results, removing real, structured noise in digital videos remains a challen...
STOC
1999
ACM
14 years 1 days ago
1999
ACM
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
RANDOM
2001
Springer
14 years 4 days 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...