Online Algorithms Susanne Albers Max-Planck-Institut f¨r Informatik, Im Stadtwald, 66123 Saarbr¨cken, Germany u u E-mail: albers@mpi-sb.mpg.de and Stefano Leonardi Dipartimento di Informatica e Sistemistica, Universit` di Roma âLa Sapienzaâ, a Via Salaria 113, 00198 Roma, Italy E-mail: leon@dis.uniroma1.it Over the past twelve years, online algorithms have received considerable research interest. Online problems had been investigated already in the seventies and early eighties but an extensive, systematic study started only when Sleator and Tarjan [41] suggested comparing an online algorithm to an optimal o ine algorithm and Karlin, Manasse, Rudolph and Sleator [29] coined the term competitive analysis. 1. FOUNDATIONS An online algorithm receives the input incrementally, one piece at a time. In response to each input portion, the algorithm must generate output, not knowing future input. In a competitive analysis an online algorithm A is compared to an optimal o ine algorithm OPT. An optimal o ine algorithm knows the entire input sequence in advance and can process it optimally. Given an input sequence I, let CA (I) and COP T (I) denote the costs incurred by A and OPT in processing I. Algorithm A is called c-competitive if there exists a constant a such that CA (I)
/lp/association-for-computing-machinery/on-line-algorithms-jHwy21C6B0