2000 character limit reached
A deterministic sublinear-time nonadaptive algorithm for metric $1$-median selection
Published 24 Feb 2015 in cs.DS | (1502.06764v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.