8 search results - page 1 / 2 » Meet and merge: approximation algorithms for confluent flows |
STOC
2003
ACM
14 years 5 months ago
2003
ACM
STOC
2004
ACM
14 years 5 months ago
2004
ACM
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...
CIAC
2010
Springer
13 years 8 months ago
2010
Springer
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...
JACM
2007
13 years 4 months ago
2007
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...
CGO
2004
IEEE
13 years 8 months ago
2004
IEEE
Static Single Assignment form is an intermediate representation that uses instructions to merge values at each confluent point of the control flow graph. instructions are not ma...