%0 Journal Article
%T A deterministic sublinear-time nonadaptive algorithm for metric $1$-median selection
%A Ching-Lueh Chang
%J Computer Science
%D 2015
%I arXiv
%X We give a deterministic $O(hn^{1+1/h})$-time $(2h)$-approximation nonadaptive algorithm for $1$-median selection in $n$-point metric spaces, where $h\in\mathbb{Z}^+\setminus\{1\}$ is arbitrary. Our proof generalizes that of Chang.
%U http://arxiv.org/abs/1502.06764v1