confluent flows | Sciweavers

click to vote

STOC
2003
ACM

86views Algorithms» more STOC 2003»

Meet and merge: approximation algorithms for confluent flows

14 years 11 months ago

Download ndssl.vbi.vt.edu

Jiangzhuo Chen, Rajmohan Rajaraman, Ravi Sundaram

claim paper

Read More »

click to vote

STOC
2004
ACM

131views Algorithms» more STOC 2004»

(Almost) tight bounds and existence theorems for confluent flows

14 years 11 months ago

Download ndssl.vbi.vt.edu

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&...

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers