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
关键词
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 条
  • [1] ON THE GREEDY ALGORITHM WITH RANDOM COSTS
    MCDIARMID, C
    MATHEMATICAL PROGRAMMING, 1986, 36 (03) : 245 - 255
  • [2] Weighted height of random trees
    Broutin, N.
    Devroye, L.
    McLeish, E.
    ACTA INFORMATICA, 2008, 45 (04) : 237 - 277
  • [3] Weighted height of random trees
    N. Broutin
    L. Devroye
    E. McLeish
    Acta Informatica, 2008, 45 : 237 - 277
  • [4] The height and size of random hash trees and random pebbled hash trees
    Devroye, L
    SIAM JOURNAL ON COMPUTING, 1999, 28 (04) : 1215 - 1224
  • [5] Asymptotic packing and the random greedy algorithm
    Rodl, V
    Thoma, L
    RANDOM STRUCTURES & ALGORITHMS, 1996, 8 (03) : 161 - 177
  • [6] Robust greedy algorithm for estimating the fundamental matrix
    Fast Capture and Real-time Image Processing Laboratory, Changchun Institute of Optics, Fine Mechanics and Physics, Chinese Academy of Sciences, Changchun 130033, China
    不详
    不详
    Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao, 2007, 5 (651-655):
  • [7] Variable selection for estimating individual tree height using genetic algorithm and random forest
    Miranda, Evandro Nunes
    Groenner Barbosa, Bruno Henrique
    Godinho Silva, Sergio Henrique
    Ussi Monti, Cassio Augusto
    Tng, David Yue Phin
    Gomide, Lucas Rezende
    FOREST ECOLOGY AND MANAGEMENT, 2022, 504
  • [8] A Note on the Random Greedy Independent Set Algorithm
    Bennett, Patrick
    Bohman, Tom
    RANDOM STRUCTURES & ALGORITHMS, 2016, 49 (03) : 479 - 502
  • [9] Universal height and width bounds for random trees
    Addario-Berry, Louigi
    Brandenberger, Anna
    Hamdan, Jad
    Kerriou, Celine
    ELECTRONIC JOURNAL OF PROBABILITY, 2022, 27
  • [10] A greedy algorithm for multicut and integral multiflow in rooted trees
    Costa, MC
    Létocart, L
    Roupin, F
    OPERATIONS RESEARCH LETTERS, 2003, 31 (01) : 21 - 27