The following pages link to A competitive 2-server algorithm (Q1182124):
Displaying 12 items.
- The \(k\)-server problem (Q458484) (← links)
- Geometric two-server algorithms (Q673915) (← links)
- Competitive randomized algorithms for nonuniform problems (Q1329146) (← links)
- A deterministic \(O(k^ 3)\)-competitive \(k\)-server algorithm for the circle (Q1329148) (← links)
- Competitive \(k\)-server algorithms (Q1329151) (← links)
- A lower bound for two-server balancing algorithms (Q1336749) (← links)
- Average performance of a greedy algorithm for the on-line minimum matching problem on Euclidean space (Q1336762) (← links)
- Trackless online algorithms for the server problem (Q1607049) (← links)
- Limited bookmark randomized online algorithms for the paging problem (Q1607066) (← links)
- Randomized algorithms for the on-line minimum matching problem on euclidean space (Q4876378) (← links)
- Dynamic pricing of servers on trees (Q5875461) (← links)
- Two online algorithms for the ambulance systems (Q5945843) (← links)
