185
click to vote
ESA
15 years 11 months ago
2004 Springer 
Sample sort, a generalization of quicksort that partitions the input into many pieces, is known as the best practical comparison based sorting algorithm for distributed memory para...
174
click to vote
ESA
15 years 11 months ago
2004 Springer 
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
170
click to vote
ESA
15 years 11 months ago
2004 Springer 
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
168
click to vote
ESA
15 years 9 months ago
2004 Springer 
The main contribution of this paper is an optimal bounded space online algorithm for variable-sized multidimensional packing. In this problem, hyperboxes must be packed in ddimens...
167
click to vote
ESA
15 years 11 months ago
2004 Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
|
Algorithms