Skip PeopleSkip Activities


Skip Search Forums

Search Forums

Skip AdministrationSkip My courses

Topic outline

This will be an advanced seminar in algorithms, designed specifically for the benefit of students planning to do research in the theoretical design and mathematical analysis of approximation algorithms. A good understanding of advanced background topics such as linear programming, linear programming duality, randomized rounding, Chernoff bounds, etc will be assumed. If you don't know these topics well, please do not take this seminar.
Network Design via Primal-Dual -- covering cuts by edges
Show only topic 1
Balanced Separators via Rounding
Show only topic 2
Embeddings / Semi-Definite Programming (SDP)
Show only topic 3
Degree-Bounded Spanning trees [may skip]
Show only topic 4
Algorithmic Game Theory
Show only topic 5
This topic 6
Multiplayer optimization games
Show only topic 6
Show only topic 7
Mechanism design
Show only topic 8
Related courses
Show only topic 9
Skip Latest News

Latest News

  • 3 Mar, 12:17
    Neal Young
    friday classes more...
  • 3 Mar, 11:14
    Neal Young
    student presentations more...
  • 26 Feb, 07:56
    Neal Young
    no class today more...
  • 24 Feb, 09:19
    Neal Young
    no class today more...
  • 22 Feb, 14:53
    Neal Young
    today in class more...
Skip Upcoming Events

Upcoming Events

There are no upcoming events
Skip Recent Activity

Recent Activity

Activity since Friday, 13 January 2012, 10:35 AM

Nothing new since your last login