Sciweavers

Share
SODA
1997
ACM
106views Algorithms» more  SODA 1997»
8 years 5 months ago
Optimal Bounds for Matching Routing on Trees
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...
Louxin Zhang
SODA
1997
ACM
171views Algorithms» more  SODA 1997»
8 years 5 months ago
A Practical Approximation Algorithm for the LMS Line Estimator
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...
David M. Mount, Nathan S. Netanyahu, Kathleen Roma...
SODA
1997
ACM
98views Algorithms» more  SODA 1997»
8 years 5 months ago
Optimal Good-Aspect-Ratio Coarsening for Unstructured Meshes
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...
Gary L. Miller, Dafna Talmor, Shang-Hua Teng
SODA
1997
ACM
115views Algorithms» more  SODA 1997»
8 years 5 months ago
On-Line Difference Maximization
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...
Ming-Yang Kao, Stephen R. Tate
SODA
1997
ACM
144views Algorithms» more  SODA 1997»
8 years 5 months ago
Methods for Achieving Fast Query Times in Point Location Data Structures
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...
Michael T. Goodrich, Mark W. Orletsky, Kumar Ramai...
SODA
1997
ACM
114views Algorithms» more  SODA 1997»
8 years 5 months ago
Better Approximation Guarantees for Job-shop Scheduling
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...
Leslie Ann Goldberg, Mike Paterson, Aravind Sriniv...
SODA
1997
ACM
95views Algorithms» more  SODA 1997»
8 years 5 months ago
Randomly Sampling Molecules
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...
Leslie Ann Goldberg, Mark Jerrum
SODA
1997
ACM
106views Algorithms» more  SODA 1997»
8 years 5 months ago
Runtime Prediction of Real Programs on Real Machines
Ulrich Finkler, Kurt Mehlhorn
books