Sciweavers

ESA
2004
Springer
95views Algorithms» more  ESA 2004»
13 years 10 months ago
An Improved Algorithm for CIOQ Switches
Abstract. The problem of maximizing the weighted throughput in various switching settings has been intensively studied recently through competitive analysis. To date, the most gene...
Yossi Azar, Yossi Richter
ESA
2004
Springer
91views Algorithms» more  ESA 2004»
13 years 10 months ago
Maximizing Throughput in Multi-queue Switches
We study a basic problem in Multi-Queue switches. A switch connects m input ports to a single output port. Each input port is equipped with an incoming FIFO queue with bounded cap...
Yossi Azar, Arik Litichevskey
ESA
2004
Springer
160views Algorithms» more  ESA 2004»
13 years 10 months ago
Optimal External Memory Planar Point Enclosure
Abstract. In this paper we study the external memory planar point enclosure problem: Given N axis-parallel rectangles in the plane, construct a data structure on disk (an index) su...
Lars Arge, Vasilis Samoladas, Ke Yi
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
13 years 10 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
96views Algorithms» more  ESA 2004»
13 years 10 months ago
An Experimental Study of Random Knapsack Problems
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
René Beier, Berthold Vöcking