Sciweavers

SODA
1996
ACM
140views Algorithms» more  SODA 1996»
14 years 8 days ago
An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees
The Maximum Agreement Subtree problem is the following: given two rooted trees whose leaves are drawn from the same set of items (e.g., species), find the largest subset of these i...
Richard Cole, Ramesh Hariharan
SODA
1996
ACM
101views Algorithms» more  SODA 1996»
14 years 8 days ago
Randomized Robot Navigation Algorithms
We consider the problem faced by a mobile robot that has to reach a given target by traveling through an unmapped region in the plane containing oriented rectangular obstacles. We...
Piotr Berman, Avrim Blum, Amos Fiat, Howard J. Kar...
SODA
1996
ACM
92views Algorithms» more  SODA 1996»
14 years 8 days ago
On-line Generalized Steiner Problem
Baruch Awerbuch, Yossi Azar, Yair Bartal
SODA
1996
ACM
138views Algorithms» more  SODA 1996»
14 years 8 days ago
Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication)
Donald Aingworth, Chandra Chekuri, Rajeev Motwani
SODA
1994
ACM
81views Algorithms» more  SODA 1994»
14 years 8 days ago
Spanning Trees Short or Small
R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel ...
SODA
1994
ACM
105views Algorithms» more  SODA 1994»
14 years 8 days ago
Approximate Data Structures with Applications
Abstract Yossi Matias Je rey Scott Vitter y Neal E. Young z In this paper we introduce the notion of approximate data structures, in which a small amount of error is tolerated in...
Yossi Matias, Jeffrey Scott Vitter, Neal E. Young
SODA
1994
ACM
75views Algorithms» more  SODA 1994»
14 years 8 days ago
Online Interval Scheduling
Richard J. Lipton, Andrew Tomkins