Approximation algorithms for combinatorial problems

Cook, 1971, The complexity of theorem-proving procedures, 151 Garey, 1972, Worst-Case analysis of memory allocation algorithms, 143 Graham, 1972, Bounds on multiprocessing anomalies and related packing algorithms, 205 Johnson, 1972, Fast allocation algorithms, 144 Johnson, 1973, Near-optimal bin packing algorithms Karp, 1972, Reducibility among combinatorial problems, 85 Matula, 1972, Graph coloring algorithms, 109 Sahni, 1973, On the knapsack and other computationally related problems J. H. Spencer, private communication. Welsh, 1967, An upper bound to the chromatic number of a graph and its application to time-tabling problems, Comput. J., 10, 85, 10.1093/comjnl/10.1.85 Wood, 1969, A technique for coloring a graph applicable to large scale time-tabling problems, Comput. J., 12, 317, 10.1093/comjnl/12.4.317