2 papers
cs.DS2024
Online sorting and online TSP: randomized, stochastic, and high-dimensional
Mikkel Abrahamsen, Ioana O. Bercea, Lorenzo Beretta +2
In the online sorting problem, items are revealed one by one and have to be placed (immediately and irrevocably) into empty cells of a size- array. The goal is to minimize t…
cs.CG2024
Online Sorting and Translational Packing of Convex Polygons
Anders Aamand, Mikkel Abrahamsen, Lorenzo Beretta +1
We investigate several online packing problems in which convex polygons arrive one by one and have to be placed irrevocably into a container, while the aim is to minimize the used…