A circle of radius 1 is given, and 8 semicircles of radius 1/2, like in this picture:

What is the radius of the smallest circle that can cover shaded area?
There was another problem involving the same picture, and this problem occurred to me while working on it. I find the formulation of this problem simple, yet it seems difficult. I used software simulation to find the desired radius, however, this does not count, a pure math solution is needed.

The smallest circle that can cover the shaded area would have a diameter equal to the furthest distance between any two points on the shaded area.
$\hskip 250 px$
I don't know how much justification you want for it, but the two most distant points are $\mathbf a$ and $\mathbf c$ on the above image. So,
$$\begin{align}r&=\frac{|\mathbf a-\mathbf b|+|\mathbf b-\mathbf c|}2\\ &=\frac12\left({\frac12+\sqrt{\left(\frac12-\frac1{\sqrt2}\right)^2+\left(\frac1{\sqrt2}\right)^2}}\right)\\ &=\frac12\left({\frac12+\sqrt{\frac{1-2\sqrt2+2}4+\frac24}}\right)\\ &=\frac{1+\sqrt{5-2\sqrt2}}4\approx0.61840643955\end{align}$$