Pages that link to "Item:Q5487824"
From MaRDI portal
The following pages link to The harmonic <i>k</i> -server algorithm is competitive (Q5487824):
Displaying 15 items.
- A simple analysis of the harmonic algorithm for two servers (Q294802) (← links)
- A fast work function algorithm for solving the \(k\)-server problem (Q300972) (← links)
- The \(k\)-server problem (Q458484) (← links)
- A primal-dual online algorithm for the \(k\)-server problem on weighted HSTs (Q1679508) (← links)
- The \(K\)-server problem via a modern optimization lens (Q1728474) (← links)
- More on random walks, electrical networks, and the harmonic \(k\)-server algorithm. (Q1853151) (← links)
- The weighted 2-server problem (Q1887090) (← links)
- On the competitive ratio of the work function algorithm for the \(k\)-server problem (Q1887093) (← links)
- The CNN problem and other \(k\)-server variants (Q1887095) (← links)
- Memoryless algorithms for the generalized k-server problem on uniform metrics (Q2117695) (← links)
- Metrical service systems with multiple servers (Q2258084) (← links)
- The ANTS problem (Q2401118) (← links)
- A \(k\)-server problem with parallel requests and unit distances (Q2446066) (← links)
- A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem (Q2503284) (← links)
- Multi-Finger Binary Search Trees (Q5091047) (← links)