Jul 2026
Online Geometric Packing through Online TSP Scheduling
The connection between packing and online sorting can be used not only for lower bounds, but also for algorithms, and it is proved that the same competitive ratio is achievable for other translational packing problems, including online packing of d-dimensional unit hyperdisks in R^{d+1}.
Anders Aamand, Mikkel Abrahamsen, Simon Bartlmae et al.
· arXiv.org · 1 citation