Pages that link to "Item:Q3546319"
From MaRDI portal
The following pages link to The generalized two-server problem (Q3546319):
Displaying 4 items.
- Online chasing problems for regular polygons (Q975435) (← links)
- Nested convex bodies are chaseable (Q1987239) (← links)
- Memoryless algorithms for the generalized k-server problem on uniform metrics (Q2117695) (← links)
- A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem (Q2503284) (← links)
