Better bounds for online line chasing
<p>We study online competitive algorithms for the <i>line chasing problem</i> in Euclidean spaces R<sup><i>d</i></sup>, where the input consists of an initial point <i>P</i><sub>0</sub> and a sequence of lines <i>X</i><...
| Päätekijät: | , , , , , |
|---|---|
| Aineistotyyppi: | Conference item |
| Kieli: | English |
| Julkaistu: |
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2019
|