Seminar Details
Greedy Algorithms
- Start Date: October 23, 2024
- Event Start Time: 12:15 PM
- Event End Time: 1:15 PM
- Seminar Series: Graduate Combinatorics Seminar
- Presenter(s): Minhao Bai - Rutgers University
- Event Location: Mathematics Graduate Student Lounge -- 7th Floor | Rutgers University | Hill Center | Mathematics Department
- Event Additional Info: <p>See: <a href="https://sites.math.rutgers.edu/~kmg326/GCS/GCS.html">https://sites.math.rutgers.edu/~kmg326/GCS/GCS.html</a></p>
- Presentation Type: Stand Alone Presentation
- 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.
