282 APPENDIX D
Karp, R. “Reducibility Among Combinatorial Problems,” in Miller, R. and
Thatcher, J. (eds.), Complexity of Computer Computations, pp. 85–104, Ple-
num Press, New York, 1972.
Lawler, E., Lenstra, J., Kan, A., and Schmoys, D. (eds.). The Traveling Salesman
Problem. Wiley, New York, 1985.
Chapter 9. Other Algorithmic Techniques
Bellman, R. Dynamic Programming. Princeton University Press, Princeton, NJ,
1957.
Bellman, R. and Dreyfus, S. Applied Dynamic Programming. Princeton Univer-
sity Press, Princeton, NJ, 1962.
Bentley, J., Johnson, D., Leighton, F., and McGeoch, C. “An Experimental
Study of Bin Packing,” Proceedings of the 21st Annual Allerton Conference on
Communication, Control, and Computing, pp. 51–60, 1983.
Brassard, G. and Bratley, P. Algorithmics: Theory and Practice. Prentice Hall,
Englewood Cliffs, NJ, 1988.
Garey, M., Graham, R., and Ullman, J. “Worst-Case Analysis of Memory Allo-
cation Algorithms,” Proceedings of the Fourth Annual ACM Symposium on The-
ory of Computing, pp. 143–150, 1976.
Garey, M. and Johnson, D. “The Complexity of Near-Optimal Graph Color-
ing,” Journal of the ACM, 23(10), pp. 43–49, 1976.
Hall, A. “On an experimental determination of ,” Messenger of Mathematics, 2 ,
pp. 113– 114, 1973.
Hochbaum, D. (ed.) Approximation Algorithms for NP-Hard Problems. PWS Pub-
lishing, Boston, MA, 1997.
Johnson, D. “Fast Allocation Algorithms,” Proceedings of the Thirteenth Annual
Symposium on Switching and Automata Theory, pp. 144–154, 1972.
Johnson, D. “Approximation Algorithms for Combinatorial Problems,” Proceed-
ings of the Fifth Annual ACM Symposium on Theory of Computing, pp. 38–49,
1973.
Johnson, D. “Worst-Case Behavior of Graph Coloring Algorithms,” Proceedings
of the Fifth Southeastern Conference on Combinatorics, Graph Theory, and Com-
puting, pp. 513–528, Utilitas Mathematica Publishing, Winnipeg, Canada,
1974.
Lawler, E., Lenstra, J., Kan, A., and Schmoys, D. (eds.). The Traveling Salesman
Problem. Wiley, New York, 1985.
Leclerc, G. Essai d’arithmétique morale, 1777.