29 research outputs found

    A lower bound for metric 1-median selection

    Full text link
    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 o(n2)o(n^2)-query (4−Ω(1))(4-\Omega(1))-approximation algorithms
    corecore