4 papers
Online Geometric Packing through Online TSP Scheduling
Anders Aamand, Mikkel Abrahamsen, Simon Bartlmae +3
We consider the problem of online packing of convex polygons into a strip by translations. While online algorithms with a constant competitive ratio have been known for rectangles…
Parameterized Algorithms for the Drone Delivery Problem
Simon Bartlmae, Andreas Hene, Joshua Könen +1
Timely delivery and optimal routing remain fundamental challenges in the modern logistics industry. Building on prior work that considers single-package delivery across networks us…
On the Hardness of the Drone Delivery Problem
Simon Bartlmae, Andreas Hene, Kelin Luo
Fast shipping and efficient routing are key problems of modern logistics. Building on previous studies that address package delivery from a source node to a destination within a gr…
NP-hardness and a PTAS for the Euclidean Steiner Line Problem
Simon Bartlmae, Paul J. Jünger, Elmar Langetepe
The Euclidean Steiner Tree Problem (EST) seeks a minimum-cost tree interconnecting a given set of terminal points in the Euclidean plane, allowing the use of additional intersectio…