On the Computational Complexity of Combinatorial Problems
- 1 January 1975
- Vol. 5 (1), 45-68
- https://doi.org/10.1002/net.1975.5.1.45
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Near-Optimal Solutions to a 2-Dimensional Placement ProblemSIAM Journal on Computing, 1975
- A bad network problem for the simplex method and other minimum cost flow algorithmsMathematical Programming, 1973
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Equivalent Integer Programs and Canonical ProblemsManagement Science, 1971
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971
- Nondeterministic AlgorithmsJournal of the ACM, 1967
- Flows in NetworksPublished by Walter de Gruyter GmbH ,1963
- On the Significance of Solving Linear Programming Problems with Some Integer VariablesEconometrica, 1960
- TWO THEOREMS IN GRAPH THEORYProceedings of the National Academy of Sciences, 1957