Valentin Polishchuk, and Jukka Suomela (Almost Stable Marriage Problem Stable Matching Problem): 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.

    15 February 2023

    • curprev 11:3111:31, 15 February 2023‎ Admin talk contribs‎ 358 bytes +358‎ Created page with "== Time Complexity == $O({1})$ == Space Complexity == $O({1})$ words (derived: must be \leq time complexity) == Description == == Approximate? == Approximate Approximation Factor: 2 + \epsilon == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2008 == Reference == https://arxiv.org/pdf/0812.4893.pdf"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Valentin_Polishchuk,_and_Jukka_Suomela_(Almost_Stable_Marriage_Problem_Stable_Matching_Problem)"