170 search results - page 1 / 34 » A Simple Greedy Algorithm for the k-Disjoint Flow Problem |
TAMC
2009
Springer
14 years 5 months ago
2009
Springer
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
APPROX
2010
Springer
14 years 21 days ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
EOR
2008
13 years 11 months ago
2008
Given arbitrary source and target nodes s, t and an s
ISAAC
2000
Springer
14 years 2 months ago
2000
Springer
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
GLOBECOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—In wireless networks, mutual interference prevents wireless devices from correctly receiving packages from others and becomes one of the challenges in the design of protocols fo...