aalto1 untyped-item.component.html
Online search for a hyperplane in high-dimensional Euclidean space
Loading...
Access rights
openAccess
publishedVersion
URL
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Unless otherwise stated, all rights belong to the author. You may download, display and print this publication for Your own personal use. Commercial use is prohibited.
Date
Department
Major/Subject
Mcode
Degree programme
Language
en
Pages
4
Series
Information Processing Letters, Volume 177
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 (d 3/2).
Description
Funding Information: We thank Paula Roth for helpful discussions. Publisher Copyright: © 2022 The Author(s)
Other note
Citation
Antoniadis, A, Hoeksma, R, Kisfaludi-Bak, S & Schewior, K 2022, 'Online search for a hyperplane in high-dimensional Euclidean space', Information Processing Letters, vol. 177, 106262. https://doi.org/10.1016/j.ipl.2022.106262