Sciweavers

68
Voted
STOC
2003
ACM
86views Algorithms» more  STOC 2003»
16 years 28 days ago
Meet and merge: approximation algorithms for confluent flows
Jiangzhuo Chen, Rajmohan Rajaraman, Ravi Sundaram
81
Voted
STOC
2004
ACM
131views Algorithms» more  STOC 2004»
16 years 28 days 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&...