DOE OSTI · 964100
Integer Equal Flows
Abstract
The integer equal flow problem is an NP-hard network flow problem, in which all arcs in given sets R{sub 1}, ..., R{sub {ell}} must carry equal flow. We show this problem is effectively inapproximable, even if the cardinality of each set R{sub k} is two. When {ell} is fixed, it is solvable in polynomial time.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Meyers, C A, Schulz, A S. 2009-01-07. Integer Equal Flows. https://doi.org/10.1016/j.orl.2009.03.006
Cite the original work for its findings. Save a collection to share your selection of sources.