Greedy algorithm for stochastic matching is a 2-approximation
Data Structures and Algorithms
2013-11-06 v2
Abstract
Motivated by applications in online dating and kidney exchange, the stochastic matching problem was introduced by Chen, Immorlica, Karlin, Mahdian and Rudra (2009). They have proven a 4-approximation of a simple greedy strategy, but conjectured that it is in fact a 2-approximation. In this paper we confirm this hypothesis.
Keywords
Cite
@article{arxiv.1007.3036,
title = {Greedy algorithm for stochastic matching is a 2-approximation},
author = {Marek Adamczyk},
journal= {arXiv preprint arXiv:1007.3036},
year = {2013}
}