On Vitali's covering theorem (Q1935333)

The authors present a fascinating discussion of the Vitali covering theorem, its origin, history, and proofs, with considerable focus on Vitali's original algorithmic proof. It is noteworthy that recent work of \textit{H. Diener} and \textit{A. Hedin} [J. Log. Anal. 4, Article 7, 22 p. (2012; Zbl 1291.03114)], which would have been unavailable at the time the paper under review was written, deals with a detailed constructive analysis of the Vitali covering theorem.