55 search results - page 5 / 11 » A Specialized Interior-Point Algorithm for Multicommodity Ne... |
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...
TAMC
2009
Springer
14 years 2 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...
STOC
2002
ACM
14 years 7 months ago
2002
ACM
We study the degradation in network performance caused by the selfish behavior of noncooperative network users. We consider a model of selfish routing in which the latency experie...
NETWORKS
2011
13 years 2 months ago
2011
Abstract. We consider a basic subproblem which arises in line planning, and is of particular importance in the context of a high system load or robustness: How much can be routed m...
NCA
2007
IEEE
14 years 1 months ago
2007
IEEE
The advancement of optical networking technologies has enabled e-science applications that often require transport of large volumes of scientific data. In support of such data-in...