SODA
1997
ACM
14 years 1 months ago
1997
ACM
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutati...
SODA
1997
ACM
14 years 1 months ago
1997
ACM
SODA
1997
ACM
14 years 1 months ago
1997
ACM
The problem of fitting a straight line to a finite collection of points in the plane is an important problem in statistical estimation. Robust estimators are widely used because...
SODA
1997
ACM
14 years 1 months ago
1997
ACM
A hierarchical gradient of an unstructured mesh M0 is a sequence of meshes M1;...;Mk such that jMkj is smaller than a given threshold mesh size b. The gradient is well-conditioned...
SODA
1997
ACM
14 years 1 months ago
1997
ACM
SODA
1997
ACM
14 years 1 months ago
1997
ACM
In this paper we examine problems motivated by on-line financial problems and stochastic games. In particular, we consider a sequence of entirely arbitrary distinct values arrivin...
SODA
1997
ACM
14 years 1 months ago
1997
ACM
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
SODA
1997
ACM
14 years 1 months ago
1997
ACM
Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein, and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogar...
SODA
1997
ACM
14 years 1 months ago
1997
ACM
We give a polynomial-time algorithm for the following problem: Given a degree sequence in which each degree is bounded from above by a constant, select, uniformly at random, an un...
SODA
1997
ACM
14 years 1 months ago
1997
ACM
