高级算法 (Fall 2017)/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.

25 October 2017

  • curprev 08:1608:16, 25 October 2017‎ imported>Etone‎ 2,586 bytes −11‎ →‎Problem 2
  • curprev 08:1508:15, 25 October 2017‎ imported>Etone‎ 2,597 bytes +2,597‎ Created page with "== Problem 1== Let <math>G(V,E)</math> be an undirected graph with positive edge weights <math>w:E\to\mathbb{Z}^+</math>. Given a partition of <math>V</math> into <math>k</mat..."
Retrieved from "https://tcs.nju.edu.cn/wiki/index.php?title=高级算法_(Fall_2017)/Problem_Set_2"