19 search results - page 1 / 4 » Multicommodity Demand Flow in a Tree |
IPL
2006
13 years 4 months ago
2006
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
ICALP
2003
Springer
13 years 10 months ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
ATMOS
2009
13 years 6 months ago
2009
Abstract. We consider a fundamental problem, called QoS-aware Multicommodity Flow, for assessing robustness in transportation planning. It constitutes a natural generalization of t...
ICCD
2002
IEEE
14 years 1 months ago
2002
IEEE
Interconnect architecture plays an important role in determining the throughput of meshed communication structures. We assume a mesh structure with uniform communication demand fo...
MP
1998
13 years 4 months ago
1998
Consider a directed graph G = (V;A), and a set of tra c demands to be shipped between pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer mult...