Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Journal of Combinatorial Theory Series B
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Treewidth: Algorithmoc Techniques and Results
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Single-source unsplittable flow
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Meet and merge: Approximation algorithms for confluent flows
Journal of Computer and System Sciences - Special issue on network algorithms 2005
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
Journal of the ACM (JACM)
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Polynomial-time algorithms for special cases of the maximum confluent flow problem
Discrete Applied Mathematics
Hi-index | 0.00 |
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 study the Maximum Confluent Flow Problem (MaxConf) with a single commodity but multiple sources and sinks. Unlike previous results, we consider heterogeneous arc capacities. The supplies and demands of the sources and sinks can also be bounded. We give a pseudo-polynomial time algorithm and an FPTAS for graphs with constant treewidth. Somewhat surprisingly, MaxConf is NP-hard even on trees, so these algorithms are, in a sense, best possible. We also show that it is NP-complete to approximate MaxConf better than 3/2 on general graphs.