Valentin Polishchuk, and Jukka Suomela (Almost Stable Marriage Problem Stable Matching Problem)
Revision as of 11:31, 15 February 2023 by Admin (talk | contribs) (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")
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