Metric $1$-median selection: Query complexity vs. approximation ratio
Computational Complexity
2015-09-21 v1
Abstract
Consider the problem of finding a point in a metric space with the minimum average distance to other points. We show that this problem has no deterministic -query -approximation algorithms for any constant .
Cite
@article{arxiv.1509.05662,
title = {Metric $1$-median selection: Query complexity vs. approximation ratio},
author = {Ching-Lueh Chang},
journal= {arXiv preprint arXiv:1509.05662},
year = {2015}
}