Programming languages: Intermediate experience with Python, Jupyter Notebook. Basic control structures in python: conditional branches, ... It covers basic algorithm design techniques such as divide ...

These algorithms are fast (often greedy algorithms) that may not produce an optimal solution but guarantees that its solution is not "too far away" from the best possible. We will present some of ...

The first attempt to solve it came in 1956, when the mathematicians Delbert Fulkerson and Lester Ford proposed what they called a "greedy solution" to the question.

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 ...