On random perfect matchings in metric spaces with not-too-large diameters
type: Item
instance of: scholarly article
title: On random perfect matchings in metric spaces with not-too-large diameters
author: Ching-Lueh Chang
published in: Theory of Computing Systems
publication date: 2022-07-26T00:00:00Z
Mathematics Subject Classification ID: 68Wxx
Mathematics Subject Classification ID: 68Rxx
Mathematics Subject Classification ID: 26-XX
zbMATH DE Number: 7562755
zbMATH Keywords: metric space
zbMATH Keywords: random matching
zbMATH Keywords: concentration bound
zbMATH Keywords: sublinear-time algorithm
zbMATH Keywords: travelling salesman problem
MaRDI profile type: Publication
full work available at URL: s00224-022-10087-8
OpenAlex ID: W4283022102
cites work: On Approximating the Average Distance Between Points
cites work: Multiembedding of Metric Spaces
cites work: On Las Vegas approximations for metric 1-median selection
cites work: Q5351928
cites work: Improved approximation algorithms for metric MaxTSP
cites work: Q3651735
cites work: Fast Approximation in Subspaces by Doubling Metric Decomposition
cites work: Sublinear‐time approximation algorithms for clustering via random sampling
cites work: Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time
cites work: Sublinear time algorithms for metric space problems
cites work: Inequalities: theory of majorization and its applications
cites work: Q4856179
cites work: All-pairs shortest paths with a sublinear additive error
cites work: Q4115333
cites work: Approximate distance oracles
DOI: 10.1007/S00224-022-10087-8
description: scientific article