Sciweavers

29 search results - page 4 / 6
» soda 1997
Sort
View
SODA
1997
ACM
111views Algorithms» more  SODA 1997»
13 years 7 months ago
Approximation Schemes for Scheduling
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Y...
SODA
1997
ACM
106views Algorithms» more  SODA 1997»
13 years 7 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
98views Algorithms» more  SODA 1997»
13 years 7 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
171views Algorithms» more  SODA 1997»
13 years 7 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
199views Algorithms» more  SODA 1997»
13 years 7 months ago
Fast Algorithms for Sorting and Searching Strings
We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C implementations for applications in which keys are character strings. T...
Jon Louis Bentley, Robert Sedgewick