Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Approximation algorithms for time constrained scheduling
Information and Computation
Efficient algorithms for generalized cut trees
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
On the Complexity of Scheduling Incompatible Jobs with Unit-Times
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
The maximum flow problem with conflict and forcing conditions
INOC'11 Proceedings of the 5th international conference on Network optimization
The minimum spanning tree problem with conflict constraints and its variations
Discrete Optimization
| Hi-index | 0.00 |
We study the maximum flow problem subject to binary disjunctive constraints in a directed graph: A negative disjunctive constraint states that a certain pair of arcs in a digraph cannot be simultaneously used for sending flow in a feasible solution. In contrast to this, positive disjunctive constraints force that for certain pairs of arcs at least one arc has to carry flow in a feasible solution. It is convenient to represent the negative disjunctive constraints in terms of a so-called conflict graph whose vertices correspond to the arcs of the underlying graph, and whose edges encode the constraints. Analogously we represent the positive disjunctive constraints by a so-called forcing graph.For conflict graphs we prove that the maximum flow problem is strongly $\mathcal{NP}$ -hard, even if the conflict graph consists only of unconnected edges. This result still holds if the network consists only of disjoint paths of length three. For forcing graphs we also provide a sharp line between polynomially solvable and strongly $\mathcal{NP}$ -hard instances for the case where the flow values are required to be integral. Moreover, our hardness results imply that no polynomial time approximation algorithm can exist for both problems. In contrast to this we show that the maximum flow problem with a forcing graph can be solved efficiently if fractional flow values are allowed.