104 search results - page 1 / 21 » A Greedy Algorithm Estimating the Height of Random Trees |
79
Voted
SIAMDM
1998
14 years 10 months ago
1998
109
Voted
DAGSTUHL
2007
15 years 9 days ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
85
Voted
APPROX
2000
Springer
15 years 3 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 ...
107
click to vote
SAC
2003
ACM
15 years 4 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
102
Voted
ISAAC
2005
Springer
15 years 4 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...