My caption 😄

Bilu-Linial Stable instances of Graph Partioniong problems


Date
Event
Algorithms reading group
Location
Mudd 3514(CS seminar room), Northwestern University

The content for the talk was mostly taken from the SODA’14 paper titled Bilu-Linial Stable Instances of Max Cut and Minimum Multiway Cut by Makarychev, Makarychev, and Vijayaraghavan. The presentation style and some of the examples were inspired by Tim Roughgarden’s lecture on the same topic.