1127 search results - page 16 / 226 » New Algorithms for Generalized Network Flows |
TAMC
2009
Springer
15 years 4 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...
TCAD
2002
14 years 9 months ago
2002
In this paper, we propose a new approach for VLSI interconnect global routing that can optimize both congestion and delay, which are often competing objectives. Our approach provi...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract—We consider multiuser scheduling in wireless networks with channel variations and flow-level dynamics. Recently, it has been shown that the MaxWeight algorithm, which i...
INFOCOM
2010
IEEE
14 years 7 months ago
2010
IEEE
We propose the tracking of long duration flows as a new network measurement primitive. Long-duration flows are characterized by their long lived nature in time, and may not have hi...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...