Sciweavers

14 search results - page 2 / 3
» waoa 2004
Sort
View
WAOA
2004
Springer
127views Algorithms» more  WAOA 2004»
13 years 10 months ago
Better Bounds for Minimizing SONET ADMs
SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic streams is determined by the routing and...
Leah Epstein, Asaf Levin
WAOA
2004
Springer
142views Algorithms» more  WAOA 2004»
13 years 10 months ago
This Side Up!
Abstract. We consider two- and three-dimensional bin packing problems where 90◦ rotations are allowed. We improve all known asymptotic performance bounds for these problems. In p...
Leah Epstein, Rob van Stee
WAOA
2004
Springer
141views Algorithms» more  WAOA 2004»
13 years 10 months ago
Strong Colorings of Hypergraphs
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...
Geir Agnarsson, Magnús M. Halldórsso...
WAOA
2004
Springer
107views Algorithms» more  WAOA 2004»
13 years 10 months ago
Order-Preserving Transformations and Greedy-Like Algorithms
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...
Spyros Angelopoulos
WAOA
2004
Springer
112views Algorithms» more  WAOA 2004»
13 years 10 months ago
Online Bin Packing with Resource Augmentation
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
Leah Epstein, Rob van Stee