Improved bounds for stochastic matching

Abstract

This results in this paper have been merged with the result in arXiv:1003.0167. The authors would like to withdraw this version. Please see arXiv:1008.5356 for the merged version.

This paper has been withdrawn due to new merged paper arXiv:1008.5356

Cited by in corpus (2)

• The Query-commit Problem
• Greedy algorithm for stochastic matching is a 2-approximation