Science!: 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.

27 February 2024

  • curprev 06:2706:27, 27 February 2024 Kmk21 talk contribs 1,036 bytes −865 No edit summary
  • curprev 06:1506:15, 27 February 2024 Kmk21 talk contribs 1,901 bytes +1,901 Created page with "Standard bipartite graph construction. Binary search on the maximum possible flow which can be met (chaning capacity from source->people, and from button->sink)> This is not necessarily tight bound? Have to demonstrate that even with this value, that we can actually construct a valid assignment. Remove unused edges with no loss of generality. Consider node A and B which should be paired with W, X in round one, and X, Y in round two. Then consider they are paired with W,..."
Retrieved from "https://wiki.speedyguy17.info/index.php/Science!"