A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Better Bounds for Online Line Chasing
2019
International Symposium on Mathematical Foundations of Computer Science
We study online competitive algorithms for the line chasing problem in Euclidean spaces R d , where the input consists of an initial point P0 and a sequence of lines X1, X2, ..., Xm, revealed one at a time. At each step t, when the line Xt is revealed, the algorithm must determine a point Pt ∈ Xt. An online algorithm is called c-competitive if for any input sequence the path P0, P1, ..., Pm it computes has length at most c times the optimum path. The line chasing problem is a variant of a more
doi:10.4230/lipics.mfcs.2019.8
dblp:conf/mfcs/BienkowskiBCCJK19
fatcat:lawdoulj65gydhonuziwl235vq