H. Alkema

most citedEuclidean TSP in Narrow Strips

1 citations · 1 across the 1 of their papers we have counts for

collaborators

2 papers

cs.CG2021

Rectilinear Steiner Trees in Narrow Strips

Henk Alkema, Mark de Berg

A rectilinear Steiner tree for a set $P$ of points in $R^{2}$ is a tree that connects the points in $P$ using horizontal and vertical line segments. The goal of Minimal Rect…

cs.CG2020★ 1 cited

Euclidean TSP in Narrow Strips

Henk Alkema, Mark de Berg, Remco van der Hofstad +1

We investigate how the complexity of Euclidean TSP for point sets $P$ inside the strip $(- \infty, + \infty) \times [0, δ]$ depends on the strip width $δ$ . We obtain two main results. F…