We consider the natural online version of the well-known unweighted b-matching problem.
We present a deterministic algorithm BALANCE whose competitive ratio is 1− 1/(1+ 1/b) a …

There has been a reasonable amount of work on on-line network optimization in the
monotone model. Usually one first analyzes the greedy algorithm that lets H i+ 1 be the …

An algorithm for vertex-coloring graphs is said to be on-line if each vertex is irrevocably
assigned a color before later vertices are considered. We show that for every such algorithm …

We introduce a new model of lookahead for on-line paging algorithms and study several
algorithms using this model. A paging algorithm is n-line with strong lookahead l if it sees the …

A general solution is presented for any finite requestanswer game to derive its optimal
competitive ratio and optimal randomized on-line algorithm against the oblivious adversary …

We consider the question of lookahead in the list update problem: What improvement can be
achieved in terms of competitiveness if an on-line algorithm sees not only the present …

Abstract Vehicle Routing Problems are generalizations of the well known Traveling
Salesman Problem; we focus on the on-line version of these problems, where requests are …

In this thesis we introduce and evaluate several new models for the analysis of online
algorithms. In an online problem, the algorithm does not know the entire input from the …

We study the advice complexity of online buffer management. Advice complexity measures
the amount of information about the future that an online algorithm needs to achieve …

In several practical circumstances we have to solve a problem whose instance is not a priori
completely known. Situations of this kind occur in computer systems and networks …