Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Sascha Geulen:

TR10-052 | 8th March 2010
Melanie Winkler, Berthold Vöcking, Sascha Geulen

Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm

Suppose a decision maker has to purchase a commodity over time with
varying prices and demands. In particular, the price per unit might
depend on the amount purchased and this price function might vary from
step to step. The decision maker has a buffer of bounded size for
storing units ... more >>>

TR10-016 | 22nd December 2009
Alexander Fanghänel, Sascha Geulen, Martin Hoefer, Berthold Vöcking

Online Capacity Maximization in Wireless Networks

In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points in Euclidean space of constant dimension $d$ arrive iteratively over time. When a new request arrives, an online algorithm needs to decide ... more >>>

ISSN 1433-8092 | Imprint