Online algorithm

In computer science, an online algorithm is one that can process its input piece-by-piece in a serial fashion, i.e., in the order that the input is fed to the algorithm, without having the entire input available from the start. In contrast, an offline algorithm is given the whole problem data from the beginning and is required to output an answer which solves the problem at hand. (For example, selection sort requires that the entire list be given before it can sort it, while insertion sort doesn't.)

Because it does not know the whole input, an online algorithm is forced to make decisions that may later turn out not to be optimal, and the study of online algorithms has focused on the quality of decision-making that is possible in this setting. Competitive analysis formalizes this idea by comparing the relative performance of an online and offline algorithm for the same problem instance. For other points of view on online inputs to algorithms, see streaming algorithm (focusing on the amount of memory needed to accurately represent past inputs), dynamic algorithm (focusing on the time complexity of maintaining solutions to problems with online inputs) and online machine learning.

A problem exemplifying the concepts of online algorithms is the Canadian Traveller Problem. The goal of this problem is to minimize the cost of reaching a target in a weighted graph where some of the edges are unreliable and may have been removed from the graph. However, that an edge has been removed (failed) is only revealed to the traveller when she/he reaches one of the edge's endpoints. The worst case for this problem is simply that all of the unreliable edges fail and the problem reduces to the usual Shortest Path Problem. An alternative analysis of the problem can be made with the help of competitive analysis. For this method of analysis, the offline algorithm knows in advance which edges will fail and the goal is to minimize the ratio between the online and offline algorithms' performance. This problem is PSPACE-complete.

Online algorithms

The names below are referenced with capital letters since they appear in papers with capital letters. The following are the names of some online algorithms:

• Algorithms for the K-server problem

• BALANCE2
• BALANCE-SLACK
• Double Coverage
• EQUIPOISE
• HANDICAP
• HARMONIC
• RANDOM-SLACK
• Tight Span Algorithm
• Tree Algorithm
• Work Function Algorithm (WFA)

See also

• Greedy algorithm
• Adversary model
• Job shop scheduling
• List update problem
• Metrical task systems
• Odds algorithm
• Paging problem
• Real-time computing
• Secretary problem
• Ski rental problem
• Linear search problem
• Search games
• Algorithms for calculating variance
• Bandit problem
• Ukkonen's algorithm

References

• Borodin, A. (1998). Online Computation and Competitive Analysis. Cambridge University Press. ISBN 0-521-56392-5. {{cite book}}: Unknown parameter |coauthors= ignored (|author= suggested) (help)

External links

• Bibliography of papers on online algorithms