The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees

Authors:
Alois Panholzer
Affiliations:
Institut für Diskrete Mathematik und Geometrie, Technische Universität Wien, Wiedner Hauptstrasse 8-10, A-1040 Wien, Austria
Venue:
Random Structures & Algorithms
Year:
2004

Citing 5
Cited 4

The expected additive weight of trees

Acta Informatica
Average-case analysis of algorithms and data structures

Handbook of theoretical computer science (vol. A)
An introduction to the analysis of algorithms

An introduction to the analysis of algorithms
On convergence rates in the central limit theorems for combinatorial structures

European Journal of Combinatorics
The wiener index of simply generated random trees

Random Structures & Algorithms

On Some Parameters in Heap Ordered Trees

Combinatorics, Probability and Computing
On the degree distribution of the nodes in increasing trees

Journal of Combinatorial Theory Series A
The hitting time for the height of a random recursive tree

Combinatorics, Probability and Computing
On the distribution of distances between specified nodes in increasing trees

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful measure for optimization problems where the random assignment algorithm ...