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(n(2))-query (4-is an element of)-approximation algor...
详细信息
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(n(2))-query (4-is an element of)-approximation algorithms for any constant is an element of > 0. (C) 2016 Elsevier Inc. All rights reserved.
暂无评论