Pages that link to "Item:Q3977290"
From MaRDI portal
The following pages link to A New Approach to the Server Problem (Q3977290):
Displayed 10 items.
- A better lower bound on the competitive ratio of the randomized 2-server problem (Q287141) (← links)
- Trees, tight-spans and point configurations (Q442355) (← links)
- Geometric two-server algorithms (Q673915) (← links)
- A note on the server problem and a benevolent adversary (Q1178219) (← links)
- A competitive 2-server algorithm (Q1182124) (← links)
- HARMONIC is 3-competitive for two servers (Q1193886) (← links)
- Competitive randomized algorithms for nonuniform problems (Q1329146) (← links)
- A lower bound for two-server balancing algorithms (Q1336749) (← links)
- The CNN problem and other \(k\)-server variants (Q1887095) (← links)
- Injective subsets of \(l_{\infty}(I)\) (Q2013990) (← links)