- Start Date:
June 12, 2008
- Event Start Time:
12:00 PM
- Event End Time:
1:00 PM
- Organizers:
Christine Agnese
- Event Location:
CoRE 301
- Seminar Series:
REU Seminar
- Presenter(s):
Beth Kupin - Rutgers University
- Abstract:
While greedy algorithms are straightforward to think about and easy to program, they usually don't give optimal solutions. It would be nice to know when exactly we can get away with a greedy algorithm, and when we need a more sophisticated tool. Conveniently enough, we can completely characterize which problems will be solvable with a greedy algorithm, based on the underlying structure of the problem. The underlying structure we need is a matroid, a pre-existing algebraic structure worth studying in their own right.
