Chandra Chekuri's Talks


Caveat Lector: Talk slides tend to be incomplete both in content and references. Moreover, it is common to sacrifice precision (and also correctness) to help in exposition. If you notice some thing egregious let me know.

Copyright: Material on this web page is Copyright 1999-2011 Chandra Chekuri. You are free to download, print, copy, and/or distribute anything on this page. Nothing on this page may be sold in any form for commerical purposes. If you use the material directly in any substantial way please give proper credit.

Recent Talks

  • Multicommodity Flows and Cuts in Polymatroidal Networks
  • Algorithms for submodular objectives: continuous extensions and dependent randomized rounding
    .pptx and .pdf (large file)
    Colloquium, TTI Chicago, December 7, 2011.
  • Buy at Bulk Network Design (with Protection)
    .pptx and .pdf (large file)
    Workshop on Approximation Algorithms: The Last Decade and the Next, Princeton, June 2011.
  • Submodular set function maximization via the multilinear relaxation and dependent randomized rounding
    .pptx and .pdf (large file)
    Plenary talk, CanaDAM, Victoria, May-June, 2011.
  • Dependent Randomized Rounding for Matroids and Applications
    .pptx and .pdf (large file)
    Invited talk, Midwest Theory Day, Chicago, December 11, 2010.
  • Submodular set function maximization: A mini survey
    .pptx and .pdf (large file)
    Invited talk, Bellairs Workshop on Approximation Algorithms, Barbados, March, 2010.
  • Online Broadcast Scheduling: New Perspectives and Results
    .pptx and .pdf (large file)
    Invited talk, MAPSP, Abbey Rolduc, June-July 2009.
  • Orienteering and related problems: mini-survey and open problems
    .pptx and .pdf
    Workshop on Approximation Algorithms and their Limitations, TTI Chicago, February 2009.
  • New algorithms for Disjoint Paths and Routing Problems
    .ppt and .pdf
    Colloquium, Dept. of Computer Science, Simon Fraser University, April 28, 2008.
  • Older Talks


    Back to Chandra's home page.