Showing cs.CGShow all
2 papers · 1 filter
cs.CG2026
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…
cs.CG2024
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…