13 citations · 38 across the 6 of their papers we have counts for
1 paper · 1 filter
Avrim Blum, John P. Dickerson, Nika Haghtalab +3
The stochastic matching problem deals with finding a maximum matching in a graph whose edges are unknown but can be accessed via queries. This is a special case of stochastic k-s…