170 search results - page 4 / 34 » A Simple Greedy Algorithm for the k-Disjoint Flow Problem |
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
Greedy algorithms are simple, but their relative power is not well understood. The priority framework [5] captures a key notion of “greediness” in the sense that it processes (...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We consider a distributed and local...
IPCO
1998
13 years 8 months ago
1998
We introduce a gain-scaling technique for the generalized maximum ow problem. Using this technique, we present three simple and intuitive polynomial-time combinatorialalgorithms fo...
SODA
1998
ACM
13 years 8 months ago
1998
ACM
A fundamental facility location problem is to choose the location of facilities, such as industrial plants and warehouses, to minimize the cost of satisfying the demand for some c...
MOBIHOC
2010
ACM
13 years 5 months ago
2010
ACM
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...