SODA 1996 | Sciweavers

41

SODA
1996
ACM

95views Algorithms» more SODA 1996»

RNC Algorithms for the Uniform Generation of Combinatorial Structures

14 years 4 months ago

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

claim paper

Read More »

41

click to vote

SODA
1996
ACM

102views Algorithms» more SODA 1996»

On RAM Priority Queues

14 years 4 months ago

Download www.cs.colostate.edu

Mikkel Thorup

claim paper

Read More »

41

click to vote

SODA
1996
ACM

143views Algorithms» more SODA 1996»

Data Collection for the Sloan Digital Sky Survey - A Network-Flow Heuristic

14 years 4 months ago

Download www.cs.ucr.edu

Robert Lupton, F. Miller Maley, Neal E. Young

claim paper

Read More »

54

click to vote

SODA
1996
ACM

157views Algorithms» more SODA 1996»

Routing and Admission Control in General Topology Networks with Poisson Arrivals

14 years 4 months ago

Download infolab.stanford.edu

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

claim paper

Read More »

50

click to vote

SODA
1996
ACM

121views Algorithms» more SODA 1996»

Optimal Placement of Convex Polygons to Maximize Point Containment

14 years 4 months ago

Download community.middlebury.edu

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

claim paper

Read More »

41

click to vote

SODA
1996
ACM

140views Algorithms» more SODA 1996»

An O(n log n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees

14 years 4 months ago

Download www.hariharan-ramesh.com

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

claim paper

Read More »

42

click to vote

SODA
1996
ACM

101views Algorithms» more SODA 1996»

Randomized Robot Navigation Algorithms

14 years 4 months ago

Download www.cs.cmu.edu

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...

claim paper

Read More »

39

click to vote

SODA
1996
ACM

92views Algorithms» more SODA 1996»

On-line Generalized Steiner Problem

14 years 4 months ago

Download www.cs.jhu.edu

Baruch Awerbuch, Yossi Azar, Yair Bartal

claim paper