Jimmy Page | algorithm | Patti Page | Bettie Page | The Front Page | RSA (algorithm) | Page | Handley Page Halifax | Ellen Page | Larry Page | Handley Page | Secure Hash Algorithm | Page McConnell | web page | Page County, Virginia | United States House of Representatives Page | Ian Page | page | Handley Page H.P.42 | Christopher Page | Alan Page | Schönhage–Strassen algorithm | Page Hannah | Luhn algorithm | Handley Page Type O | Handley Page Hampden | Earley's Algorithm | Dijkstra's algorithm | CYK algorithm | Viterbi algorithm |
This optimal result is referred to as Bélády's optimal algorithm or the clairvoyant algorithm.
The special case of metrics in which all distances are equal is called the paging problem because it models the problem of page replacement algorithms in memory caches, and was also already known to have a k-competitive algorithm (Sleator and Tarjan 1985).