When LP is the Cure for Your Matching Woes: Approximating Stochastic Matchings

Abstract

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

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

Cited by in corpus (2)

• Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems
• The Query-commit Problem