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).
•
The problem was first posed by Mark Manasse, Lyle A. McGeoch and Daniel Sleator (1990).
Microsoft Exchange Server | Microsoft SQL Server | Active Server Pages | X.Org Server | web server | Apache HTTP Server | Server Message Block | Windows Server 2008 | Windows Server | Year 2000 problem | Windows Server 2003 | Web server | Waring's problem | The Final Problem | Server (computing) | server (computing) | server | The Problem with Popplers | Team Foundation Server | proxy server | Oracle WebLogic Server | Hume and the Problem of Causation | Dirichlet problem | Boolean satisfiability problem | Web Server Gateway Interface | The Dog Problem | Tammes problem | SQL Server Reporting Services | Species problem | Spatial Query Server |