Sciweavers

SODA
1996
ACM
95views Algorithms» more  SODA 1996»
14 years 8 days ago
RNC Algorithms for the Uniform Generation of Combinatorial Structures
We describe several RNC algorithms for generating graphs and subgraphs uniformly at random. For example, unlabelled undirected graphs are generated in O(lg3 n) time using O n2 lg3...
Michele Zito, Ida Pu, Martyn Amos, Alan Gibbons
SODA
1996
ACM
102views Algorithms» more  SODA 1996»
14 years 8 days ago
On RAM Priority Queues
Mikkel Thorup
SODA
1996
ACM
143views Algorithms» more  SODA 1996»
14 years 8 days ago
Data Collection for the Sloan Digital Sky Survey - A Network-Flow Heuristic
Robert Lupton, F. Miller Maley, Neal E. Young
SODA
1996
ACM
157views Algorithms» more  SODA 1996»
14 years 8 days ago
Routing and Admission Control in General Topology Networks with Poisson Arrivals
Emerging high speed networks will carry tra c for services such as video-on-demand and video teleconferencing that require resource reservation along the path on which the tra c i...
Anil Kamath, Omri Palmon, Serge A. Plotkin
SODA
1996
ACM
121views Algorithms» more  SODA 1996»
14 years 8 days ago
Optimal Placement of Convex Polygons to Maximize Point Containment
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
Matthew Dickerson, Daniel Scharstein
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