137
click to vote
ESA
15 years 7 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...
133
click to vote
ESA
15 years 7 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...
129
click to vote
ESA
15 years 7 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...
127
click to vote
ESA
15 years 7 months ago
2004 Springer 
Let G = (V, E) be an undirected multi-graph with a special vertex root ∈ V , and where each edge e ∈ E is endowed with a length l(e) ≥ 0 and a capacity c(e) > 0. For a pa...
124
click to vote
ESA
15 years 7 months ago
2004 Springer 
Abstract. We propose a novel randomized algorithm for computing a dominating set based clustering in wireless ad-hoc and sensor networks. The algorithm works under a model which ca...
|
Algorithms