We will be having a special meeting with some club alumni who are now at CMU’s Algorithms, Combinatorics, and Optimization program.
The plan is to have a couple of short presentations followed by a panel/Q&A on CS research and grad school. Pizza will be provided.
Previous: Greedy algorithm optimizing submodular functions
Continuing with the theme of combinatorial optimization and approximate algorithms, Stephen presented a simple approximate greedy algorithm for optimizing monotone, submodular set functions.
continue reading ❯