Sciweavers

ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 7 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
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...
Elliot Anshelevich, Lisa Zhang
ESA
2004
Springer
166views Algorithms» more  ESA 2004»
15 years 7 months ago
Super Scalar Sample Sort
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...
Peter Sanders, Sebastian Winkel
ESA
2004
Springer
103views Algorithms» more  ESA 2004»
15 years 7 months ago
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems
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...
Michael R. Fellows, Christian Knauer, Naomi Nishim...
ESA
2004
Springer
125views Algorithms» more  ESA 2004»
15 years 7 months ago
Approximation Algorithms for Quickest Spanning Tree Problems
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...
Refael Hassin, Asaf Levin
ESA
2004
Springer
151views Algorithms» more  ESA 2004»
15 years 5 months ago
On Variable-Sized Multidimensional Packing
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...
Leah Epstein, Rob van Stee
Algorithms
Top of PageReset Settings