English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Online Search for a Hyperplane in High-Dimensional Euclidean Space

Antoniadis, A., Hoeksma, R., Kisfaludi-Bak, S., & Schewior, K. (2021). Online Search for a Hyperplane in High-Dimensional Euclidean Space. Retrieved from https://arxiv.org/abs/2109.04340.

Item is

Files

show Files
hide Files
:
arXiv:2109.04340.pdf (Preprint), 2MB
Name:
arXiv:2109.04340.pdf
Description:
File downloaded from arXiv at 2022-01-05 11:14
OA-Status:
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
Copyright Date:
-
Copyright Info:
-

Locators

show

Creators

show
hide
 Creators:
Antoniadis, Antonios1, Author           
Hoeksma, Ruben1, Author
Kisfaludi-Bak, Sándor2, Author           
Schewior, Kevin1, Author           
Affiliations:
1External Organizations, ou_persistent22              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: Computer Science, Computational Geometry, cs.CG,Computer Science, Data Structures and Algorithms, cs.DS
 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
$\Omega(d)\cap O(d^{3/2})$.

Details

show
hide
Language(s): eng - English
 Dates: 2021-09-092021
 Publication Status: Published online
 Pages: 7 p.
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: arXiv: 2109.04340
URI: https://arxiv.org/abs/2109.04340
BibTex Citekey: Antoniadis_2109.04340
 Degree: -

Event

show

Legal Case

show

Project information

show

Source

show