Pages that link to "Item:Q1853532"
From MaRDI portal
The following pages link to The 3-server problem in the plane. (Q1853532):
Displaying 13 items.
- A fast work function algorithm for solving the \(k\)-server problem (Q300972) (← links)
- The \(k\)-server problem (Q458484) (← links)
- On the advice complexity of the \(k\)-server problem under sparse metrics (Q503460) (← links)
- R-LINE: a better randomized 2-server algorithm on the line (Q888438) (← links)
- Online chasing problems for regular polygons (Q975435) (← links)
- Manhattan orbifolds (Q1044880) (← links)
- On the competitive ratio of the work function algorithm for the \(k\)-server problem (Q1887093) (← links)
- The online \(k\)-server problem with max-distance objective (Q2344003) (← links)
- Asymptotically optimal online page migration on three points (Q2350908) (← links)
- On Advice Complexity of the k-server Problem under Sparse Metrics (Q2868631) (← links)
- Online facility assignment (Q5919330) (← links)
- Breaking the 2-competitiveness barrier for two servers in a tree (Q6052700) (← links)
- Deterministic 3-server on a circle and the limitation of canonical potentials (Q6634376) (← links)
