๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Relaxed balance for search trees with local rebalancing

โœ Scribed by Kim S. Larsen; Thomas Ottmann; Eljas Soisalon-Soininen

Publisher
Springer-Verlag
Year
2001
Tongue
English
Weight
139 KB
Volume
37
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

AVL Trees with Relaxed Balance
AVL Trees with Relaxed Balance
โœ Kim S. Larsen ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 185 KB

The idea of relaxed balance is to uncouple the rebalancing in search trees from the updating in order to speed up request processing in main-memory databases. In this paper, we describe a relaxed version of AVL trees. We prove that each update gives rise to at most a logarithmic number of rebalancin

Local search algorithms for the k-cardin
Local search algorithms for the k-cardinality tree problem
โœ Christian Blum; Matthias Ehrgott ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 463 KB

In this paper we deal with an NP-hard combinatorial optimization problem, the k-cardinality tree problem in node-weighted graphs. This problem has several applications, which justify the need for e cient methods to obtain good solutions. We review existing literature on the problem. Then we prove th