Valentin Polishchuk, and Jukka Suomela (Almost Stable Marriage Problem Stable Matching Problem)

From Algorithm Wiki

Jump to navigation Jump to search

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/w/index.php?title=Valentin_Polishchuk,_and_Jukka_Suomela_(Almost_Stable_Marriage_Problem_Stable_Matching_Problem)&oldid=44366"