The following pages link to (Q4449208):
Displaying 14 items.
- The \(k\)-server problem (Q458484) (← links)
- A randomized algorithm for two servers in cross polytope spaces (Q627107) (← links)
- Geometric two-server algorithms (Q673915) (← links)
- A competitive 2-server algorithm (Q1182124) (← links)
- Competitive \(k\)-server algorithms (Q1329151) (← links)
- Randomized competitive analysis for two server problems (Q1662430) (← links)
- The weighted 2-server problem (Q1887090) (← links)
- The CNN problem and other \(k\)-server variants (Q1887095) (← links)
- Memoryless algorithms for the generalized k-server problem on uniform metrics (Q2117695) (← links)
- The orthogonal CNN problem (Q2390236) (← links)
- A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem (Q2503284) (← links)
- On fast algorithms for two servers (Q3988823) (← links)
- (Q4763407) (← links)
- The Generalized Work Function Algorithm Is Competitive for the Generalized 2-Server Problem (Q5419031) (← links)
