  We answer a question of Peikert and Rosen by giving for each $\epsilon > 0$
an efficient construction of infinite families of number fields $N$ such that
the root discriminant $D_N^{1/[N:\mathbb{Q}]}$ is bounded above by a constant
times $[N:\mathbb{Q}]^\epsilon$.
