Integer equal flows
The integer equal flow problem is an NP-hard network flow problem, in which all arcs in given sets R1,…,R[subscript ℓ] must carry equal flow. We show that this problem is effectively inapproximable, even if the cardinality of each set R[subscript k] is two. When ℓ is fixed, it is solvable in polynom...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Elsevier Science
2010
|
| Online Access: | http://hdl.handle.net/1721.1/54777 https://orcid.org/0000-0002-9595-459X |