The following pages link to (Q4527040):
Displaying 19 items.
- The \(k\)-server problem (Q458484) (← links)
- Spanners in sparse graphs (Q657919) (← links)
- On multi-threaded metrical task systems (Q849631) (← links)
- A randomized algorithm for two servers on the line. (Q1854341) (← links)
- A general decomposition theorem for the \(k\)-server problem (Q1854527) (← links)
- New results for online page replication (Q1887086) (← links)
- The weighted 2-server problem (Q1887090) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- Uniform metrical task systems with a limited number of states (Q2380010) (← links)
- Ramsey-type theorems for metric spaces with applications to online problems (Q2496321) (← links)
- A Combinatorial Metrical Task System Problem Under the Uniform Metric (Q2831385) (← links)
- An optimal on-line algorithm for metrical task system (Q4302787) (← links)
- Better Algorithms for Unfair Metrical Task Systems and Applications (Q4429694) (← links)
- Metrical Task Systems on Trees via Mirror Descent and Unfair Gluing (Q4994985) (← links)
- STACS 2004 (Q5309725) (← links)
- A randomized on–line algorithm for the <i>k</i>–server problem on a line (Q5486309) (← links)
- A tight bound on approximating arbitrary metrics by tree metrics (Q5917578) (← links)
- Local embeddings of metric spaces (Q5919791) (← links)
- Parametrized Metrical Task Systems (Q6084418) (← links)
