Some Related Problems from Network Flows, Game Theory and Integer Programming
We consider several important problems for which no polynomially time bounded algorithm is known. These problems are shown to be related in that a polynomial algorithm for one implies a polynomial algorrithm for the others.
computer science; technical report
Previously Published As