Paper Info
Title
Online search for a hyperplane in high-dimensional Euclidean space
Abstract
We consider the online search problem in which a server starting at the origin of a d-dimensional Euclidean space has to find an arbitrary hyperplane. The best-possible competitive ratio and the length of the shortest curve from which each point on the d-dimensional unit sphere can be seen are within a constant factor of each other. We show that this length is in Ω(d)∩O(d3/2).
Year
DOI
Venue
2022
10.1016/j.ipl.2022.106262
Information Processing Letters
Keywords
DocType
Volume
Sphere inspection,Online search problem,On-line algorithms,Computational geometry,Cow-path problem
Journal
177
ISSN
Citations 
PageRank 
0020-0190
0
0.34
References 
Authors
0
4
Name
Order
Citations
PageRank
Antonios Antoniadis112713.81
Ruben Hoeksma2338.23
Sándor Kisfaludi-Bak359.21
Kevin Schewior4379.79