-- 3: intro: replace "efficient" by "linear"
-- 3.1.7, 3.1.10: skip proof
-- 3.3: do we really need the full Komlos's result?
-- 3.3.17: maxflow: shouldn't Karzanov be cited, too?
-- 3.5.1: does the first alg give any insight?
-- 3.5.1: mention geometric distribution
-- 5.4.6: could we give a simple proof?
-- 5: mention graphs with moving vertices?
-- 6: mention d-regular graphs
-- 6: two monographs on Euclidean MST
- M. Steel: Probability theory and combinatorial optimization, SIAM 1997
- J. Yukich: Probability theory of classical Euclidean optimization problems, Springer 1998
+> 3.1.7, 3.1.10: skip proof
+> 3.5.1: does the first alg give any insight?
+> 5: mention graphs with moving vertices?