A greedy algorithm estimating the height of random trees

被引：0
|
作者：
Luczak, T [1 ]
机构：
[1] Polish Acad Sci, Math Inst, Poznan, Poland
[2] Adam Mickiewicz Univ, Dept Discrete Math, PL-60769 Poznan, Poland
来源：
SIAM JOURNAL ON DISCRETE MATHEMATICS | 1998年 / 11卷 / 02期
关键词：
random trees; greedy algorithms;
D O I：
10.1137/S0895480193258960
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The behavior of a greedy algorithm which estimates the height of a random, labelled rooted tree is studied. A self-similarity argument is used to characterize the limit distribution of the length H of the path found by such an algorithm in a random rooted tree as the unique solution of an integral equation. Furthermore, it is shown that [GRAPH] i.e., the expected length of the path constructed by the algorithm is roughly 93.8% of the expected height of a random rooted tree.
引用
收藏
页码：318 / 329
页数：12
相关论文
共 50 条
  • [21] AN IMPROVED GREEDY ALGORITHM FOR SIGNAL RECOVERY FROM RANDOM MEASUREMENTS
    Jin, Jian
    Gu, Yuantao
    Mei, Shunliang
    2010 IEEE 10TH INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING PROCEEDINGS (ICSP2010), VOLS I-III, 2010, : 82 - 85
  • [22] Analysis of greedy algorithm for vertex covering of random graph by cubes
    Toman, Eduard
    Stanek, Martin
    COMPUTING AND INFORMATICS, 2006, 25 (05) : 393 - 404
  • [23] The Height of Random k-Trees and Related Branching Processes
    Cooper, Colin
    Frieze, Alan
    Uehara, Ryuhei
    RANDOM STRUCTURES & ALGORITHMS, 2014, 45 (04) : 675 - 702
  • [24] Width and mode of the profile for some random trees of logarithmic height
    Devroye, Luc
    Hwang, Hsien-Kuei
    ANNALS OF APPLIED PROBABILITY, 2006, 16 (02): : 886 - 918
  • [25] Development and evaluation of an improved algorithm for estimating TIBL height
    Petersen, RL
    10TH JOINT CONFERENCE ON THE APPLICATIONS OF AIR POLLUTION METEOROLOGY WITH THE A&WMA, 1998, : 242 - 246
  • [26] Split Trees - A Unifying Model for Many Important Random Trees of Logarithmic Height: A Brief Survey
    Holmgren, Cecilia
    DISCRETE GEOMETRY AND MATHEMATICAL MORPHOLOGY, DGMM 2021, 2021, 12708 : 20 - 57
  • [27] A Greedy Algorithm for Connection Admission Control in Wireless Random Access Networks
    Gu, Bo
    Zhang, Cheng
    Yamori, Kyoko
    Tanaka, Yoshiaki
    2013 19TH ASIA-PACIFIC CONFERENCE ON COMMUNICATIONS (APCC): SMART COMMUNICATIONS TO ENHANCE THE QUALITY OF LIFE, 2013, : 456 - 457
  • [28] Large deviations of the greedy independent set algorithm on sparse random graphs
    Kolesnik, Brett
    RANDOM STRUCTURES & ALGORITHMS, 2022, 61 (02) : 353 - 363
  • [29] The distribution of height and diameter in random non-plane binary trees
    Broutin, Nicolas
    Flajolet, Philippe
    RANDOM STRUCTURES & ALGORITHMS, 2012, 41 (02) : 215 - 252
  • [30] Euclidean Greedy Drawings of Trees
    Noellenburg, Martin
    Prutkin, Roman
    DISCRETE & COMPUTATIONAL GEOMETRY, 2017, 58 (03) : 543 - 579
12345