Teaching Talks
-
Randomization in algorithms some thoughts
-
S-T connectivity in O(log(n)) space and random walks
-
Introduction to Combinatorial Auctions
-
The optimal FRT randomized tree. Courtesy of Surrender Baswana I wish to thank him for his slides
-
Algorithm a presentation for the layman. Some slides are due to Samir Khuller
-
A simple O(log n) approximated for undirected multicut
-
A simple explanation of the GW primal-dual for Steiner Forest
-
A very simple explanaton Dual-fitting of Lovats for Set Cover
-
Exact algorithm for the Assignment Problem by iterative rounding
-
Exact algorithm for matching and Vertex cover on Bipartite graph by iterative rounding
-
Directed Multicut approximation
-
A simple charging scheme for the algorithm of Jain for Steiner Network
-
A simple explanation of the Positive Semi-Definite approximation for Max-Cut