Sciweavers

CIAC
2010
Springer
246views Algorithms» more  CIAC 2010»
13 years 8 months ago
Capacitated Confluent Flows: Complexity and Algorithms
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
Daniel Dressler and Martin Strehler
STOC
2004
ACM
131views Algorithms» more  STOC 2004»
14 years 4 months ago
(Almost) tight bounds and existence theorems for confluent flows
A flow is said to be confluent if at any node all the flow leaves along a single edge. Given a directed graph G with k sinks and non-negative demands on all the nodes of G, we con...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...