Article ID Journal Published Year Pages File Type
437617 Theoretical Computer Science 2015 9 Pages PDF
Abstract

We give a deterministic O(hn1+1/h)O(hn1+1/h)-time (2h)(2h)-approximation nonadaptive algorithm for 1-median selection in n  -point metric spaces, where h∈Z+∖{1}h∈Z+∖{1} is arbitrary. Our proof generalizes that of Chang [2].

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
A deterministic sublinear-time nonadaptive algorithm for metric 1-median selection
Authors
,