Online Algorithm Article Index for
Online
Website Links For
Online
 

Information About

Online Algorithm




As an example of the problem consider the problem of finding a Shortest Path in a finite connected Graph when the graph is unknown and the algorithm receives the Node neighbours only when it "enters" the node. It is clear that this problem can not be solved optimally without a simple exhaustive search. Thus, new performance measures have to be introduced, such as Competitive Analysis , which compares the performance of an online algorithm with that of a hypothetical offline algorithm that knows the entire input in advance.


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:


SEE ALSO




REFERENCES