Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Hi-index | 0.00 |
It is known by Sahni [2] that the integral flow problem with overlapped bundles is NP-complete. We show that this problem remains NP-complete even if the bundles are disjoint.