A deterministic sublinear-time nonadaptive algorithm for metric $1$-median selection
Data Structures and Algorithms
2015-02-25 v1
Abstract
We give a deterministic -time -approximation nonadaptive algorithm for -median selection in -point metric spaces, where is arbitrary. Our proof generalizes that of Chang.
Cite
@article{arxiv.1502.06764,
title = {A deterministic sublinear-time nonadaptive algorithm for metric $1$-median selection},
author = {Ching-Lueh Chang},
journal= {arXiv preprint arXiv:1502.06764},
year = {2015}
}