The euclidean distortion of complete binary trees

Nathan Linial; Michael Saks

doi:10.1007/s00454-002-2827-z

The euclidean distortion of complete binary trees

Nathan Linial^*, Michael Saks

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

15 Scopus citations

Abstract

Bourgain showed that every embedding of the complete binary tree of depth n into l₂ has metric distortion ≥ Ω (√logn). An alternative proof was later given by Matousek. This note contains a short proof for this fact.

Original language	English
Pages (from-to)	19-21
Number of pages	3
Journal	Discrete and Computational Geometry
Volume	29
Issue number	1
DOIs	https://doi.org/10.1007/s00454-002-2827-z
State	Published - Jan 2003

Access to Document

10.1007/s00454-002-2827-z

Cite this

@article{aa7a078de9fa472a9394ded5247c37f0,

title = "The euclidean distortion of complete binary trees",

abstract = "Bourgain showed that every embedding of the complete binary tree of depth n into l2 has metric distortion ≥ Ω (√logn). An alternative proof was later given by Matousek. This note contains a short proof for this fact.",

author = "Nathan Linial and Michael Saks",

year = "2003",

month = jan,

doi = "10.1007/s00454-002-2827-z",

language = "אנגלית",

volume = "29",

pages = "19--21",

journal = "Discrete and Computational Geometry",

issn = "0179-5376",

publisher = "Springer New York",

number = "1",

}

TY - JOUR

T1 - The euclidean distortion of complete binary trees

AU - Linial, Nathan

AU - Saks, Michael

PY - 2003/1

Y1 - 2003/1

N2 - Bourgain showed that every embedding of the complete binary tree of depth n into l2 has metric distortion ≥ Ω (√logn). An alternative proof was later given by Matousek. This note contains a short proof for this fact.

AB - Bourgain showed that every embedding of the complete binary tree of depth n into l2 has metric distortion ≥ Ω (√logn). An alternative proof was later given by Matousek. This note contains a short proof for this fact.

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

U2 - 10.1007/s00454-002-2827-z

DO - 10.1007/s00454-002-2827-z

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0037634590

SN - 0179-5376

VL - 29

SP - 19

EP - 21

JO - Discrete and Computational Geometry

JF - Discrete and Computational Geometry

IS - 1

ER -

The euclidean distortion of complete binary trees

Abstract

Access to Document

Other files and links

Fingerprint

Cite this