265
click to vote
WADS
15 years 11 months ago
2009 Springer 
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
191
click to vote
WADS
15 years 11 months ago
2009 Springer 
We develop algorithms to compute edge sequences, Voronoi diagrams, shortest path maps, the Fréchet distance, and the diameter for a polyhedral surface. Distances on the surface a...
177
click to vote
WADS
15 years 11 months ago
2009 Springer 
This paper provides a systematic study of several proposed measures for online algorithms in the context of a specific problem, namely, the two server problem on three colinear po...
188
click to vote
WADS
15 years 11 months ago
2009 Springer 
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
|
Algorithms