SODA
1998
ACM
14 years 29 days ago
1998
ACM
d Abstract) David A. Grable Alessandro Panconesi BRICS Report Series RS-97-37 ISSN 0909-0878 December 1997
SODA
1998
ACM
14 years 29 days ago
1998
ACM
We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of reque...
SODA
1998
ACM
14 years 29 days ago
1998
ACM
We describe a new exact-arithmetic approach to linear programming when the number of variables n is much larger than the number of constraints m (or vice versa). The algorithm is ...
SODA
1998
ACM
14 years 29 days ago
1998
ACM
SODA
1998
ACM
14 years 29 days ago
1998
ACM
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...
SODA
1998
ACM
14 years 29 days ago
1998
ACM
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit distance between the pattern and the matching text substring is at most k. The fir...
SODA
1998
ACM
14 years 29 days ago
1998
ACM
SODA
1998
ACM
14 years 29 days ago
1998
ACM
SODA
1998
ACM
14 years 29 days ago
1998
ACM
We consider the problem of implementing nger search trees on the pointer machine, i.e., how to maintain a sorted list such that searching for an element x, starting the search at ...
SODA
1998
ACM
14 years 29 days ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...