448 search results - page 5 / 90 » Fast Approximation Algorithms for Multicommodity Flow Proble... |
ICAISC
2004
Springer
14 years 26 days ago
2004
Springer
Our discussion in this article centers on the application of ant algorithms to the non-bifurcated multicommodity flow problem. We propose a general framework of ant algorithm that...
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...
ESA
2003
Springer
14 years 21 days ago
2003
Springer
NETWORKS
2008
13 years 7 months ago
2008
WADS
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...