随机算法 (Fall 2015)/Problem Set 2: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

13 November 2015

6 November 2015

  • curprev 03:3703:37, 6 November 2015‎ imported>Etone‎ 1,503 bytes +23‎ No edit summary
  • curprev 03:2503:25, 6 November 2015‎ imported>Etone‎ 1,480 bytes +921‎ No edit summary
  • curprev 03:1003:10, 6 November 2015‎ imported>Etone‎ 559 bytes +559‎ Created page with "== Problem 1== For any <math>\alpha\ge 1</math>, a cut <math>C</math> in an undirected (multi)graph <math>G(V,E)</math>is called an <math>\alpha</math>-min-cut if <math>|C|\le..."
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=随机算法_(Fall_2015)/Problem_Set_2"