A linear time algorithm for a matching problem on the circle
type: Item
instance of: scholarly article
title: A linear time algorithm for a matching problem on the circle
zbMATH Open document ID: 0925.68197
DOI: 10.1016/S0020-0190(98)00048-9
author: Carlos Cabrelli
author: Ursula Molter
published in: Information Processing Letters
publication date: 1998-08-13T00:00:00Z
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 1190153
zbMATH Keywords: Algorithms
zbMATH Keywords: Computational complexity
zbMATH Keywords: Minimal matching
MaRDI profile type: Publication
cites work: Q4335196
cites work: The Kantorovich metric for probability measures on the circle
cites work: Weighted median algorithms for \(L_ 1\) approximation
cites work: Selecting the Kth Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $
cites work: Two special cases of the assignment problem
cites work: A linear selection algorithm for sets of elements with weights
cites work: Q4176809
cites work: Bipartite graph matching for points on a line or a circle
cites work: A distance metric for multidimensional histograms
full work available at URL: s0020-0190(98)00048-9
OpenAlex ID: W2039935006
description: scientific article; zbMATH DE number 1190153