skip to main | skip to sidebar

15-854B: Advanced Approximation Algorithms

http://www.cs.cmu.edu/~anupamg/adv-approx/
This material is based upon work supported by the National Science Foundation under Grant No. CCF-0747250. Any opinions, findings and conclusions or recomendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the National Science Foundation (NSF).

Monday, April 14, 2008

Lecture 24: UGC-Hardness of Max-Cut

The completion of the proof of the reduction from Unique Label-Cover to Max-Cut can be found here.
Posted by Ryan O'Donnell at 11:36 AM

No comments:

Post a Comment

Newer Post Older Post Home
Subscribe to: Post Comments (Atom)

Blog Archive

  • ▼  2008 (55)
    • ▼  April (10)
      • Another clarification on HW6
      • Clarification on HW6
      • Course evaluation time...
      • Integrality Gaps for Sparsest Cut
      • Hardness of Independent Set
      • End of Lecture 25
      • Homework 5 graded
      • Homework 6 out
      • Lecture 24: UGC-Hardness of Max-Cut
      • Homework 4
    • ►  March (11)
    • ►  February (15)
    • ►  January (19)
  • ►  2007 (1)
    • ►  November (1)