Corpus ID: 5632061

Greedy algorithm for stochastic matching is a 2-approximation

@article{Adamczyk2010GreedyAF,
  title={Greedy algorithm for stochastic matching is a 2-approximation},
  author={M. Adamczyk},
  journal={ArXiv},
  year={2010},
  volume={abs/1007.3036}
}
  • M. Adamczyk
  • Published 2010
  • Mathematics, Computer Science
  • ArXiv
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. 
3 Citations

References

SHOWING 1-10 OF 13 REFERENCES
Online Stochastic Matching: Beating 1-1/e
  • 253
  • PDF
When LP is the Cure for Your Matching Woes: Approximating Stochastic Matchings
  • 8
  • PDF
Improved bounds for stochastic matching
  • 2
  • PDF
Approximating Matches Made in Heaven
  • 93
  • PDF
Stochastic Submodular Maximization
  • 65
Stochastic Covering and Adaptivity
  • 48
  • PDF
AdWords and generalized online matching
  • 192
An optimal algorithm for on-line bipartite matching
  • 605
  • PDF
...
1
2
...