On Las Vegas approximations for metric 1-median selection
type: Item
instance of: scholarly article
title: On Las Vegas approximations for metric 1-median selection
zbMATH Open document ID: 1478.68447
author: Ching-Lueh Chang
published in: Information Processing Letters
publication date: 2019-04-26T00:00:00Z
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 54E35
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 7047947
zbMATH Keywords: 1-median
zbMATH Keywords: sublinear-time algorithm
zbMATH Keywords: metric space
zbMATH Keywords: closeness centrality
zbMATH Keywords: randomized aigorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2019.02.007
OpenAlex ID: W2918722366
cites work: On Approximating the Average Distance Between Points
cites work: Deterministic sublinear-time approximations for metric 1-median selection
cites work: Metric 1-Median Selection
cites work: Fast Approximation of Centrality
cites work: Approximating average parameters of graphs
cites work: Sublinear time algorithms for metric space problems
cites work: Q4349924
cites work: Linear-time approximation schemes for clustering problems in any dimensions
cites work: Optimal time bounds for approximate clustering
cites work: Q5526189
cites work: On approximating metric 1-median in sublinear time
Wikidata QID: Q128310397
DOI: 10.1016/J.IPL.2019.02.007
description: scientific article; zbMATH DE number 7047947