2022
DOI: 10.1016/j.ipl.2022.106262
|View full text |Cite
|
Sign up to set email alerts
|

Online search for a hyperplane in high-dimensional Euclidean space

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(10 citation statements)
references
References 12 publications
0
10
0
Order By: Relevance
“…Then γ and γ are linearly independent on U . So (2) shows that θ > 0 almost everywhere on U , via Cauchy-Schwarz inequality. Hence θ is monotone on U , which yields that γ is star-shaped with respect to o in a neighborhood of each point of U .…”
Section: Unfoldingmentioning
confidence: 86%
See 2 more Smart Citations
“…Then γ and γ are linearly independent on U . So (2) shows that θ > 0 almost everywhere on U , via Cauchy-Schwarz inequality. Hence θ is monotone on U , which yields that γ is star-shaped with respect to o in a neighborhood of each point of U .…”
Section: Unfoldingmentioning
confidence: 86%
“…By absolute constant here we mean that C does not depend on n or γ. A Hamiltonian path in the edge graph of the cross polytope, i.e., the unit ball with respect to the L 1norm in R n , gives an example of a curve with L ≤ 2n √ nr [2]. Thus ( 5) is sharp up to the constant C. To establish (5), we may set r = 1.…”
Section: Appendixmentioning
confidence: 99%
See 1 more Smart Citation
“…Up to a constant factor in the optimal competitive ratio, using the standard doubling argument, one can assume without loss of generality that H has distance 1 from 0 [2]. Defining H to be the set of such hyperplanes, the competitive ratio of the cow path is simply the total distance traveled until the cow path has hit every H ∈ H .…”
Section: Preliminariesmentioning
confidence: 99%
“…In higher dimensions, even the asymptotic behavior of the optimal competitive ratio remains open. The best upper and lower bounds, due to Antoniadis et al [2], are O(d 3/2 ) and Ω(d), leaving a gap of roughly √ d. In this note, we settle the optimal d-dimensional competitive ratio up to low-order terms, presenting a simple argument for a lower bound of Ω(d 3/2 ), or, more precisely, Ω(d 3/2 / √ log d). Concurrent work by Ghomi and Wenk [9], posted on arXiv a few days before this note, establishes a d-dimensional competitive ratio of Ω(d 3/2 ) (communicated by Nazarov).…”
Section: Introductionmentioning
confidence: 99%