Analysis of Algorithms : An Active Learning Approach

REFERENCES 283

Metropolis, I. and Ulam, S. “The Monte Carlo Method,” Journal of the American
Statistical Association, 44(247), pp. 335–341, 1949.
Sahni, S. “Approximate Algorithms for the 0/1 Knapsack Problem,” Journal of
the ACM, 22(10), pp. 115–124, 1975.
Sahni, S. “Algorithms for Scheduling Independent Tasks,” Journal of the ACM,
23(1), pp. 116–127, 1976.
Wigderson, A. “Improving the Performance Guarantee for Approximate Graph
Coloring,” Journal of the ACM, 30(4), pp. 729–735, 1983.
Yao, F. “Speed-Up in Dynamic Programming,” SIAM Journal on Algebraic and
Discrete Methods, 3(4), pp. 532–540, 1982.