Duke Wiki  logo
Child pages
  • Theory Reading Group, Fall 2013

Versions Compared

Key

  • This line was added.
  • This line was removed.
  • Formatting was changed.

...

 
DateTimeLocationSpeakerPaperLink
09/06/1310:00 amLSRC D309Sungjin ImConstructive Discrepancy Minimization by walking on the edges, Lovett and Meka
http://arxiv.org/pdf/1203.5747v2.pdf
09/13/1310:00 amLSRC D309Janardhan Kulkarni Approximating Bin Packing within O(log OPT log log OPT) bins, Rothvosshttp://arxiv.org/abs/1301.4010
09/20/1310:00 amLSRC D309Kamesh Munagala

The weighted majority algorithm, and applications to fast, parallel algorithm design

http://theoryofcomputing.org/articles/v008a006/
09/27/1310:00 amLSRC D309Debmalya Panigrahi

Electrical flows, Laplacian systems and faster approximation of maximum flow in undirected graphs, Christiano, Kelner, Madry, Spielman, and Teng

http://arxiv.org/abs/1010.2921
10/04/1310:00 amLSRC D309Vahid Liaghat Eight-Fifth Approximation for TSP Paths, Sebohttp://arxiv.org/abs/1209.3523
10/11/1310:00 am

LSRC D309

Jiangwei Pan A constructive proof of the general Lovász Local Lemma, Moser and Tardos http://arxiv.org/abs/0903.0544
10/18/1310:00 amLSRC D309Xiaoming (Nate) XuThe Price of Stability for Undirected Broadcast Network Design with Fair Cost Allocation is Constant, Bilo, Flammini, and Moscardel 
10/25/1310:00 amLSRC D309  Vahid Liaghat

Online Node-weighted Steiner Forest and Extensions via Disk Paintings, Hajiaghayi, Liaghat, and Panigrahi

http://www.cs.duke.edu/~debmalya/papers/focs13-steiner-forest.pdf
11/01/1310:00 amLSRC D309 Sam Haney  
11/08/1310:00 amLSRC D309 STOC deadline 
11/15/1310:00 amLSRC D309 Abhinandan Nath  
11/22/1310:00 amLSRC D309 Nat Kell