We will learn some divide and conquer algorithms for Integer Multiplication (Karatsuba’s Algorithm), Matrix Multiplication (Strassen’s Algorithm), Fast Fourier Transforms (FFTs), and Finding Closest ...

To solve this, the greedy algorithm will launch as much traffic as possible (three lanes of cars) along the route, adjusting its capacity and repeating the same steps for other routes until every ...

Joseph L. Gerver, L. Thomas Ramsey, Sets of Integers With No Long Arithmetic Progressions Generated by the Greedy Algorithm, Mathematics of Computation, Vol. 33, No. 148 (Oct., 1979), pp. 1353-1359 ...