"Greedy algorithm for stochastic matching is a 2-approximation"

Marek Adamczyk (2010)
a service of Schloss Dagstuhl - Leibniz Center for Informatics