This course covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP ...

It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to ... Fast Fourier Transforms (FFT), a ...

Robert E. Jensen, A Dynamic Programming Algorithm for Cluster Analysis, Operations Research, Vol. 17, No. 6 (Nov. - Dec., 1969), pp. 1034-1057 Free online reading for over 10 million articles Save and ...