Computing Euclidean bottleneck matchings in higher dimensions

Alon Efrat, Matthew J. Katz

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

We extend the planar results of Chang et al. (1992) to higher dimensions, and show that given a set A of 2n points in d-space it is possible to compute a Euclidean bottleneck matching of A in roughly O(n1.5) time, for d≤6, and in subquadratic time, for any constant d>6. If the underlying norm is L, then it is possible to compute a bottleneck matching of A in O(n1.5 log0.5 n) time, for any constant d≥2.

Original languageEnglish (US)
Pages (from-to)169-174
Number of pages6
JournalInformation Processing Letters
Volume75
Issue number4
DOIs
StatePublished - Sep 30 2000
Externally publishedYes

Fingerprint

Higher Dimensions
Euclidean
Computing
D-space
Norm

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Computing Euclidean bottleneck matchings in higher dimensions. / Efrat, Alon; Katz, Matthew J.

In: Information Processing Letters, Vol. 75, No. 4, 30.09.2000, p. 169-174.

Research output: Contribution to journalArticle

@article{a9cc3f2c9076481c8ab8fac435ac2e80,
title = "Computing Euclidean bottleneck matchings in higher dimensions",
abstract = "We extend the planar results of Chang et al. (1992) to higher dimensions, and show that given a set A of 2n points in d-space it is possible to compute a Euclidean bottleneck matching of A in roughly O(n1.5) time, for d≤6, and in subquadratic time, for any constant d>6. If the underlying norm is L∞, then it is possible to compute a bottleneck matching of A in O(n1.5 log0.5 n) time, for any constant d≥2.",
author = "Alon Efrat and Katz, {Matthew J.}",
year = "2000",
month = "9",
day = "30",
doi = "10.1016/S0020-0190(00)00096-X",
language = "English (US)",
volume = "75",
pages = "169--174",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "4",

}

TY - JOUR

T1 - Computing Euclidean bottleneck matchings in higher dimensions

AU - Efrat, Alon

AU - Katz, Matthew J.

PY - 2000/9/30

Y1 - 2000/9/30

N2 - We extend the planar results of Chang et al. (1992) to higher dimensions, and show that given a set A of 2n points in d-space it is possible to compute a Euclidean bottleneck matching of A in roughly O(n1.5) time, for d≤6, and in subquadratic time, for any constant d>6. If the underlying norm is L∞, then it is possible to compute a bottleneck matching of A in O(n1.5 log0.5 n) time, for any constant d≥2.

AB - We extend the planar results of Chang et al. (1992) to higher dimensions, and show that given a set A of 2n points in d-space it is possible to compute a Euclidean bottleneck matching of A in roughly O(n1.5) time, for d≤6, and in subquadratic time, for any constant d>6. If the underlying norm is L∞, then it is possible to compute a bottleneck matching of A in O(n1.5 log0.5 n) time, for any constant d≥2.

UR - http://www.scopus.com/inward/record.url?scp=0034272969&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034272969&partnerID=8YFLogxK

U2 - 10.1016/S0020-0190(00)00096-X

DO - 10.1016/S0020-0190(00)00096-X

M3 - Article

AN - SCOPUS:0034272969

VL - 75

SP - 169

EP - 174

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 4

ER -