On ultrametric 1-median selection

09/05/2019

∙

by   Ching-Lueh Chang, et al.

∙

0

∙

share

Consider the problem of finding a point in an ultrametric space with the minimum average distance to all points. We give this problem a Monte Carlo O((log^2(1/ϵ))/ϵ^3)-time (1+ϵ)-approximation algorithm for all ϵ>0.