English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

Searching for a line on the plane with $n$ unit speed robots is a classiconline problem that dates back to the 50's, and for which competitive ratioupper bounds are known for every $n\geq 1$. In this work we improve the bestlower bound known for $n=2$ robots from 1.5993 to 3. Moreover we prove that thecompetitive ratio is at least $\sqrt{3}$ for $n=3$ robots, and at least$1/\cos(\pi/n)$ for $n\geq 4$ robots. Our lower bounds match the best upperbounds known for $n\geq 4$, hence resolving these cases. To the best of ourknowledge, these are the first lower bounds proven for the cases $n\geq 3$ ofthis several decades old problem.

Lower Bounds for Shoreline Searching with 2 or More Robots