Johnson, David S. Approximation algorithms for combinatorial problems. (English) Zbl 0296.65036 J. Comput. Syst. Sci. 9, 256-278 (1974). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 10 ReviewsCited in 458 Documents MSC: 65K05 Numerical mathematical programming methods 68Q25 Analysis of algorithms and problem complexity 68W99 Algorithms in computer science 05A05 Permutations, words, matrices 05C15 Coloring of graphs and hypergraphs × Cite Format Result Cite Review PDF Full Text: DOI References: [1] Cook, S. A., The complexity of theorem-proving procedures, (Proceedings of the 3rd Annual ACM Symposium on the Theory of Computing (1971)), 151-158 · Zbl 0363.68125 [2] Garey, M. R.; Graham, R. L.; Ullman, J. D., Worst-Case analysis of memory allocation algorithms, (Proceedings of the 4th Annual ACM Symposium on the Theory of Computing (1972)), 143-150 · Zbl 0357.68027 [3] Graham, R. L., Bounds on multiprocessing anomalies and related packing algorithms, (Proceedings of the Spring Joint Computer Conference (1972)), 205-217 [4] Johnson, D. S., Fast allocation algorithms, (Proceedings of the 13th Annual IEEE Symposium on Switching and Automata Theory (1972)), 144-154 [5] Johnson, D. S., Near-optimal bin packing algorithms, (Ph.D. Dissertation (1973), Massachusetts Institute of Technology: Massachusetts Institute of Technology Cambridge, MA) [6] Karp, R. M., Reducibility among combinatorial problems, (Miller, R. E.; Thatcher, J. W., Complexity of Computer Computations (1972), Plenum Press: Plenum Press New York), 85-104 · Zbl 0366.68041 [7] Matula, D. W.; Marble, G.; Issacson, J. D., Graph coloring algorithms, (Read, R. C., Graph Theory and Computing (1972), Academic Press), 109-122 · Zbl 0256.05108 [8] Sahni, S. K., On the knapsack and other computationally related problems, (Ph.D. Dissertation (1973), Cornell University: Cornell University Ithaca, NY) [9] J. H. Spencer; J. H. Spencer [10] Welsh, D. J.A.; Powell, M. B., An upper bound to the chromatic number of a graph and its application to time-tabling problems, Comput. J., 10, 85-86 (1967) · Zbl 0147.15206 [11] Wood, D. C., A technique for coloring a graph applicable to large scale time-tabling problems, Comput. J., 12, 317-319 (1969) · Zbl 0193.53601 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.