Minhao Bai, Rutgers University

Abstract

I'm going to briefly introduce greedy algorithms. It's commonly used in a lot of problem-solving situations to make things easy. In most cases, we use it very heuristically. But why in those cases is going greedy optimal? Why is it not optimal sometimes? Why do we still want to study greedy algorithm when it's not giving you the best solution? In the talk I'm going to show both theories and examples.

See: https://sites.math.rutgers.edu/~kmg326/GCS/GCS.html