Over the past ten years, online algorithms have re-ceived considerable research interest. Online problems had been investigated already in the seventies and early eighties but an extensive, systematic study only started when Sleator and Tarjan (1985) suggested comparing an online algorithm to an optimal oine algorithm and Karlin, Manasse, Rudolph and Sleator (1988) coined the term competitive analysis. In this article we give an in-troduction to the theory of online algorithms and survey interesting application areas. We present important re-sults and outline directions for future research
This paper is devoted to the online dominating set problem and its variants. We believe the paper re...
Online algorithms deal with settings where the input data arrives over time and the current decision...
We consider a model for online computation in which the online algorithm receives, together with eac...
Over the past twelve years, online algorithms have received considerable research interest. Online p...
This book chapter reviews fundamental concepts and results in the area of online algorithms. We firs...
This chapter presents an introduction to the competitive analysis of online algorithms. In an online...
We propose a new approach to competitive analysis in online scheduling by introducing the novel conc...
Online algorithms are used in a variety of situations such as forex trading, cache replacement, and ...
the supervisor, Adi Rosén, is not fluent enough in French. Le contexte général In online computat...
We consider the problem of minimizing weighted flow time on a single machine in the preemptive setti...
We consider the problem of online scheduling of jobs on unrelated machines with dynamic speed scalin...
Let be a set of on-line algorithms for a problem P with input set I . We assume that P can be ...
Abstract We first consider online speed scaling algorithms to min-imize the energy used subject to t...
This thesis proposes and evaluates some online algorithms for machine scheduling problems. Determini...
We consider the problem of online scheduling of jobs on unrelated machines with dynamic speed scalin...
This paper is devoted to the online dominating set problem and its variants. We believe the paper re...
Online algorithms deal with settings where the input data arrives over time and the current decision...
We consider a model for online computation in which the online algorithm receives, together with eac...
Over the past twelve years, online algorithms have received considerable research interest. Online p...
This book chapter reviews fundamental concepts and results in the area of online algorithms. We firs...
This chapter presents an introduction to the competitive analysis of online algorithms. In an online...
We propose a new approach to competitive analysis in online scheduling by introducing the novel conc...
Online algorithms are used in a variety of situations such as forex trading, cache replacement, and ...
the supervisor, Adi Rosén, is not fluent enough in French. Le contexte général In online computat...
We consider the problem of minimizing weighted flow time on a single machine in the preemptive setti...
We consider the problem of online scheduling of jobs on unrelated machines with dynamic speed scalin...
Let be a set of on-line algorithms for a problem P with input set I . We assume that P can be ...
Abstract We first consider online speed scaling algorithms to min-imize the energy used subject to t...
This thesis proposes and evaluates some online algorithms for machine scheduling problems. Determini...
We consider the problem of online scheduling of jobs on unrelated machines with dynamic speed scalin...
This paper is devoted to the online dominating set problem and its variants. We believe the paper re...
Online algorithms deal with settings where the input data arrives over time and the current decision...
We consider a model for online computation in which the online algorithm receives, together with eac...