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

• Type: Conference
• Year: 2010
• Where: CIAC
• Authors: Daniel Dressler and Martin Strehler
• Keywords: Algorithms, CIAC 2010, Confluent Flow, Heterogeneous Arc Capacities, Maximum Confluent Flow