It is easy to verify that this explicit solution tends to 0 at ", so that in the case of these surfaces there is a solution " f " tending to 0 at " . proves this directly for simply connected surfaces and uses it to deduce the uniformization theorem.
22.
As showed, both the random part of this algorithm and the need to construct an explicit solution to the linear programming relaxation may be eliminated using the method of conditional probabilities, leading to a deterministic greedy algorithm for set cover, known already to Lov�sz, that repeatedly selects the set that covers the largest possible number of remaining uncovered elements.
