Sciweavers

8 search results - page 1 / 2
» Optimal Binary Search Trees with Costs Depending on the Acce...
Sort
View
CORR
2011
Springer
169views Education» more  CORR 2011»
12 years 10 months ago
Upper Bounds for Maximally Greedy Binary Search Trees
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Der...
Kyle Fox
CIAC
1994
Springer
148views Algorithms» more  CIAC 1994»
13 years 7 months ago
Efficient Reorganization of Binary Search Trees
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
Micha Hofri, Hadas Shachnai
ALGORITHMICA
2000
161views more  ALGORITHMICA 2000»
13 years 3 months ago
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...
APPROX
2008
Springer
245views Algorithms» more  APPROX 2008»
13 years 5 months ago
Approximating Optimal Binary Decision Trees
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, . ....
Micah Adler, Brent Heeringa