Pages that link to "Item:Q5419031"
From MaRDI portal
The following pages link to The Generalized Work Function Algorithm Is Competitive for the Generalized 2-Server Problem (Q5419031):
Displaying 6 items.
- Nested convex bodies are chaseable (Q1987239) (← links)
- Memoryless algorithms for the generalized k-server problem on uniform metrics (Q2117695) (← links)
- Metrical service systems with multiple servers (Q2258084) (← links)
- Better Bounds for Online Line Chasing (Q5092366) (← links)
- Lipschitz selectors may not yield competitive algorithms for convex body chasing (Q6050222) (← links)
- Deterministic 3-server on a circle and the limitation of canonical potentials (Q6634376) (← links)
