✦ LIBER ✦

A Greedy Algorithm Estimating the Height of Random Trees

✍ Scribed by Luczak, Tomasz

Book ID: 118198110
Publisher: Society for Industrial and Applied Mathematics
Year: 1998
Tongue: English
Weight: 315 KB
Volume: 11
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480193258960

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Planar-shape prototype generation using

Planar-shape prototype generation using a tree-based random greedy algorithm

✍ Wen-Yao Chen; Wen-Liang Hwang; Tien-Ching Lin 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 309 KB

A Partial Analysis of Random Height-Bala

A Partial Analysis of Random Height-Balanced Trees

✍ Brown, Mark R. 📂 Article 📅 1979 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 787 KB

The Height and Size of Random Hash Trees

The Height and Size of Random Hash Trees and Random Pebbled Hash Trees

✍ Devroye, Luc 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 314 KB

On the Variance of the Height of Random

On the Variance of the Height of Random Binary Search Trees

✍ Devroye, Luc; Reed, Bruce 📂 Article 📅 1995 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 522 KB

Distribution of the Height of a Random T

Distribution of the Height of a Random Tree with Labeled Edges

✍ Sevastyanov, B. A. 📂 Article 📅 1994 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 411 KB

A disturbed version of the greedy algori

A disturbed version of the greedy algorithm

✍ W. Wenzel 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 147 KB

We study a disturbed variant of the classical greedy algorithm for weight functions defined on some given finite set E and show that the greedy algorithm for matroids is stable with respect to changes in the input data.