Sciweavers

WAOA
2004
Springer
111views Algorithms» more  WAOA 2004»
14 years 4 months ago
More Powerful and Simpler Cost-Sharing Methods
We provide a new technique to derive group strategyproof mechanisms for the cost-sharing problem. Our technique is simpler and provably more powerful than the existing one based on...
Paolo Penna, Carmine Ventre
WAOA
2004
Springer
132views Algorithms» more  WAOA 2004»
14 years 4 months ago
Stochastic Online Scheduling on Parallel Machines
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic ...
Nicole Megow, Marc Uetz, Tjark Vredeveld
WAOA
2004
Springer
91views Algorithms» more  WAOA 2004»
14 years 4 months ago
Pricing Network Edges to Cross a River
Abstract. We consider a Stackelberg pricing problem in directed networks. Tariffs have to be defined by an operator, the leader, for a subset of the arcs, the tariff arcs. Clien...
Alexander Grigoriev, Stan P. M. van Hoesel, Anton ...
WAOA
2004
Springer
76views Algorithms» more  WAOA 2004»
14 years 4 months ago
Improved Bounds for Sum Multicoloring and Scheduling Dependent Jobs with Minsum Criteria
Rajiv Gandhi, Magnús M. Halldórsson,...
WAOA
2004
Springer
142views Algorithms» more  WAOA 2004»
14 years 4 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
112views Algorithms» more  WAOA 2004»
14 years 4 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
WAOA
2004
Springer
127views Algorithms» more  WAOA 2004»
14 years 4 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
85views Algorithms» more  WAOA 2004»
14 years 4 months ago
A PTAS for Delay Minimization in Establishing Wireless Conference Calls
A prevailing feature of mobile telephony systems is that the location of a mobile user may be unknown. Therefore, when the system has to establish a call between users, it may nee...
Leah Epstein, Asaf Levin