Deterministic sublinear-time approximations for metric 1-median selection

Given oracle access to an n-point metric space (M,d), let metric 1-median be the problem of finding argminx∈M∑y∈Md(x,y), breaking ties arbitrarily. We show that metric 1-median has a deterministic nonadaptive O(n3/2)-time 4-approximation algorithm. ► Metric 1-median asks for a point x in a metric sp...

Full description

Saved in:

Bibliographic Details
Published in:	Information processing letters Vol. 113; no. 8; pp. 288 - 292
Main Author:	Chang, Ching-Lueh
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 30.04.2013 Elsevier Sequoia S.A
Subjects:	Algorithm Algorithms Approximation Mathematical problems Median selection Metric 1-median selection Metric space Nonevasive algorithm Query complexity Studies Sublinear-time algorithm Vector space Sublinear-time algorithm Query complexity Metric space Metric 1-median selection Median selection Nonevasive algorithm Algorithm
ISSN:	0020-0190, 1872-6119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!