CORE
🇺🇦Â
 make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
A lower bound for metric 1-median selection
Authors
Ching-Lueh Chang
Publication date
9 January 2014
Publisher
View
on
arXiv
Abstract
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
)
o(n^2)
o
(
n
2
)
-query
(
4
−
Ω
(
1
)
)
(4-\Omega(1))
(
4
−
Ω
(
1
))
-approximation algorithms
Similar works
Full text
Available Versions
CiteSeerX
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:CiteSeerX.psu:10.1.1.755.4...
Last time updated on 30/10/2017