157
Voted
ESA
2000
Springer
15 years 7 months ago
2000
Springer
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
122
Voted
ESA
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We show that all algebraic-geometric codes possess a succinct representation that allows for the list decoding algorithms of [15, 7] to run in polynomial time. We do this...
137
Voted
ESA
2000
Springer
15 years 7 months ago
2000
Springer
For a set P of points in the plane, we introduce a class of triangulations that is an extension of the Delaunay triangulation. Instead of requiring that for each triangle the circ...
123
Voted
ESA
2000
Springer
15 years 7 months ago
2000
Springer
119
Voted
ESA
2000
Springer
15 years 7 months ago
2000
Springer
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...