Presentation Dates

11/19/13: Adam Lelkes, Yi Huang
11/21/13: Wei Zhou, Luija Wang
11/26/13: Jeremy Kun, Dainel Braithwaite
11/29/13: Thanksgiving -- no class
12/3/13: Li Ge, John Hardwick
12/5/13: in-class final

Possible Papers

Linear Programming and Simplex

[taken by Yi Huang] Daniel A. Spielman, Shang-Hua Teng: Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. J. ACM 51(3): 385-463 (2004)
Jonathan A. Kelner, Daniel A. Spielman: A randomized polynomial-time simplex algorithm for linear programming. STOC 2006: 51-60
[taken by Lujia Wang] Dimitris Bertsimas, Santosh Vempala: Solving convex programs by random walks. J. ACM 51(4): 540-556 (2004)
[taken by Wei Zhou] Dimitris Bertsimas, Georgia Perakis, Sridhar Tayur: A New Algebraic Geometry Algorithm for Integer Programming. Management Science 46(7): 999-1008 (2000)

Minimum Spanning Trees

Bernard Chazelle: A minimum spanning tree algorithm with Inverse-Ackermann type complexity. J. ACM 47(6): 1028-1047 (2000)
Seth Pettie, Vijaya Ramachandran: An optimal minimum spanning tree algorithm. J. ACM 49(1): 16-34 (2002)
[taken by John Hardwick] David R. Karger, Philip N. Klein, Robert Endre Tarjan: A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees. J. ACM 42(2): 321-328 (1995)
Brandon Dixon, Monika Rauch, Robert Endre Tarjan: Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time. SIAM J. Comput. 21(6): 1184-1192 (1992)

Shortest Paths

[taken by Daniel Braithwaite] Samir Khuller, Balaji Raghavachari, Neal E. Young: Balancing Minimum Spanning Trees and Shortest-Path Trees. Algorithmica 14(4): 305-321 (1995)
[taken by Li Ge] Andrew V. Goldberg: A Practical Shortest Path Algorithm with Linear Expected Time. SIAM J. Comput. 37(5): 1637-1655 (2008)

Flows &c.

Rohit Khandekar, Satish Rao, Umesh V. Vazirani: Graph partitioning using single commodity flows. J. ACM 56(4) (2009)
Yin Tat Lee, Satish Rao, Nikhil Srivastava: A new approach to computing maximum flows using electrical flows. STOC 2013: 755-764
Frank Thomson Leighton, Satish Rao: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46(6): 787-832 (1999)
James B. Orlin: Max flows in O(nm) time, or better. STOC 2013: 765-774


Mechthild Stoer, Frank Wagner: A simple min-cut algorithm. J. ACM 44(4): 585-591 (1997)
Sanjeev Arora, Satish Rao, Umesh V. Vazirani: Expander flows, geometric embeddings and graph partitioning. J. ACM 56(2) (2009)
Sanjeev Arora, Elad Hazan, Satyen Kale: O(sqrt(log(n)) Approximation to Sparsest Cut in Õ(n2) Time. SIAM J. Comput. 39(5): 1748-1771 (2010)


[taken by Adam Lelkes] Richard M. Karp, Umesh V. Vazirani, Vijay V. Vazirani: An Optimal Algorithm for On-line Bipartite Matching. STOC 1990: 352-358
Harold N. Gabow, Haim Kaplan, Robert Endre Tarjan: Unique Maximum Matching Algorithms. J. Algorithms 40(2): 159-183 (2001)


Sanjeev Arora: Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and other Geometric Problems. J. ACM 45(5): 753-782 (1998)
Hyung-Chan An, Robert Kleinberg, David B. Shmoys: Improving christofides' algorithm for the s-t path TSP. STOC 2012: 875-886


[taken by Jeremy Kun] John C. Platt: Fast training of support vector machines using sequential minimal optimization Advances in Kernel Methods: Support Vector Machines (1998)
Tamas Solymosi, Tirukkannamangai E.S. Raghavan: An Algorithm for Finding the Nucleolus of Assignment Games. International Journal of Game Theory (23): 119-143 (1994)