59 search results - page 8 / 12 » Finger Search Trees with Constant Insertion Time |
100
click to vote
STOC
2003
ACM
15 years 12 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
95
Voted
COMPGEOM
2010
ACM
15 years 4 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
126
click to vote
CN
2004
14 years 11 months ago
2004
In this paper, we introduce a new IP lookup scheme with worst-case search and update time of O(log n), where n is the number of prefixes in the forwarding table. Our scheme is base...
106
click to vote
SBBD
2007
15 years 1 months ago
2007
The main contribution of this paper is a bulk-loading algorithm for multi-way dynamic metric access methods based on the covering radius of a representative, like the Slim-tree. Th...
99
Voted
CPM
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...