Some related problems from network flows, game theory and integer programming
- 1 October 1972
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02724847,p. 130-138
- https://doi.org/10.1109/swat.1972.23
Abstract
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 algorithm for the others.Keywords
This publication has 5 references indexed in Scilit:
- Computing Partitions with Applications to the Knapsack ProblemJournal of the ACM, 1974
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Some Recent Developments inn-Person Game TheorySIAM Review, 1971
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- An Algorithm for Finding a Minimum Equivalent Graph of a DigraphJournal of the ACM, 1969