8 search results - page 1 / 2 » Optimal Binary Search Trees with Costs Depending on the Acce... |
69
Voted
CIAC
2003
Springer
15 years 3 months ago
2003
Springer
101
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
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...
112
Voted
CIAC
1994
Springer
15 years 2 months ago
1994
Springer
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...
104
click to vote
ALGORITHMICA
2000
14 years 10 months ago
2000
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...
120
Voted
APPROX
2008
Springer
15 years 5 days 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, . ....