55 search results - page 4 / 11 » A Specialized Interior-Point Algorithm for Multicommodity Ne... |
FOCS
2002
IEEE
14 years 12 days ago
2002
IEEE
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
MIDDLEWARE
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we consider the problem of maximising utility in linked market-driven distributed and Grid systems. In such systems, users submit jobs through brokers who can virtua...
ICCSA
2005
Springer
14 years 29 days ago
2005
Springer
The major objective of this paper is to deploy an effective evolutionary algorithm (EA) for the congestion problem in connection-oriented networks. The network flow is modeled as n...
ESA
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
JACM
2007
13 years 7 months ago
2007
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...