39 search results - page 2 / 8 » Total Path Length For Random Recursive Trees |
RSA
2010
13 years 3 months ago
2010
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...
APPROX
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
APPROX
2000
Springer
13 years 9 months ago
2000
Springer
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
SOFSEM
1997
Springer
13 years 8 months ago
1997
Springer
This paper surveys recent results in the area of virtual path layout in ATM networks. We present a model for the theoretical study of these layouts the model amounts to covering t...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...