3 papers
cs.CG2021
Online Search for a Hyperplane in High-Dimensional Euclidean Space
Antonios Antoniadis, Ruben Hoeksma, Sándor Kisfaludi-Bak +1
We consider the online search problem in which a server starting at the origin of a -dimensional Euclidean space has to find an arbitrary hyperplane. The best-possible competiti…
cs.CG2021
A better lower bound for Lower-Left Anchored Rectangle Packing
Ruben Hoeksma, Matthew Maat
Given any set of points in the unit square that contains the origin, does a set of axis aligned rectangles, one for each point in , exist, such that each of them has a point…
cs.DS2018
A PTAS for Euclidean TSP with Hyperplane Neighborhoods
Antonios Antoniadis, Krzysztof Fleszar, Ruben Hoeksma +1
In the Traveling Salesperson Problem with Neighborhoods (TSPN), we are given a collection of geometric regions in some space. The goal is to output a tour of minimum length that vi…