2 search results - page 1 / 1 » A fixed-parameter tractability result for multicommodity dem... |
IPL
2006
13 years 8 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
14 years 1 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 ...