SODA
2001
ACM
13 years 5 months ago
2001
ACM
SODA
2001
ACM
13 years 5 months ago
2001
ACM
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
SODA
2001
ACM
13 years 5 months ago
2001
ACM
SODA
2001
ACM
13 years 5 months ago
2001
ACM
SODA
2001
ACM
13 years 5 months ago
2001
ACM
We compute the regression depth of a k-flat in a set of n points in Rd, in time O(nd-2 + n log n) for 1 k d - 2. This contrasts with a bound of O(nd-1 + n log n) when k = 0 or
SODA
2001
ACM
13 years 5 months ago
2001
ACM
We provide improved approximation algorithms for several rectangle tiling and packing problems (RTILE, DRTILE and d-RPACK) studied in the literature. Our algorithms are highly eff...
SODA
2001
ACM
13 years 5 months ago
2001
ACM
We propose a discrete variant of the Bak-Sneppen model for self-organized criticality. In this process, a configuration is an n-bit word, and at each step one chooses a random bit...
SODA
2001
ACM
13 years 5 months ago
2001
ACM
SODA
2001
ACM
13 years 5 months ago
2001
ACM
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
SODA
2001
ACM
13 years 5 months ago
2001
ACM