29 research outputs found
A lower bound for metric 1-median selection
Consider the problem of finding a point in an n-point metric space with the
minimum average distance to all points. We show that this problem has no
deterministic -query -approximation algorithms