SODA
1993
ACM
13 years 5 months ago
1993
ACM
SODA
1993
ACM
13 years 5 months ago
1993
ACM
The following bounds on the competitive ratios of deterministic and randomized on-line algorithms for traversing width-w layered graphs are obtained.
SODA
1993
ACM
13 years 5 months ago
1993
ACM
SODA
1993
ACM
13 years 5 months ago
1993
ACM
SODA
1993
ACM
13 years 5 months ago
1993
ACM
SODA
1993
ACM
13 years 5 months ago
1993
ACM
We present an algorithm for maintaining binary search trees. The amortized complexity per INSERT or DELETE is O(log n) while the worst-case cost of a SEARCH is O(log n). Scapegoat...
SODA
1993
ACM
13 years 5 months ago
1993
ACM
We consider the performance of a simple greedy matching algorithm MINGREEDY when applied to random cubic graphs. We show that if λn is the expected number of vertices not matched...
SODA
1993
ACM
13 years 5 months ago
1993
ACM
We introduce a new method for nding several types of optimal k-point sets, minimizing perimeter, diameter, circumradius, and related measures, by testing sets of the O(k) nearest ...
SODA
1993
ACM
13 years 5 months ago
1993
ACM
SODA
1993
ACM
13 years 5 months ago
1993
ACM
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...