The following pages link to On convex body chasing (Q1207798):
Displaying 15 items.
- Online chasing problems for regular polygons (Q975435) (← links)
- Nested convex bodies are chaseable (Q1987239) (← links)
- (Q3760332) (← links)
- Competitive Algorithms for Layered Graph Traversal (Q4210157) (← links)
- Handling Critical Jobs Online: Deadline Scheduling and Convex-Body Chasing (Q4685726) (← links)
- Chasing Convex Bodies with Linear Competitive Ratio (Q5056421) (← links)
- Better Bounds for Online Line Chasing (Q5092366) (← links)
- Chasing Convex Bodies Optimally (Q5146869) (← links)
- A Nearly-Linear Bound for Chasing Nested Convex Bodies (Q5236189) (← links)
- Algorithms for energy conservation in heterogeneous data centers (Q5925533) (← links)
- Algorithms for energy conservation in heterogeneous data centers (Q5925673) (← links)
- Lipschitz selectors may not yield competitive algorithms for convex body chasing (Q6050222) (← links)
- Parametrized Metrical Task Systems (Q6084418) (← links)
- Chasing convex bodies optimally (Q6608553) (← links)
- Online geometric covering and piercing (Q6614105) (← links)