Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
Online Sorting with Our Eyes Wide Shut
Charalampos Platanos, Thanos Tolias
In Online Sorting, we are given an array of initially empty cells. At each time step , an element arrives and must be placed irrevocably into an empt…
cs.DS2025
A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
Andreas Kalavas, Charalampos Platanos, Thanos Tolias
In \emph{Online Sorting}, an array of initially empty cells is given. At each time step , an element arrives and must be placed irrevocably into an empty cel…
cs.DS2025
A Polylogarithmic Competitive Algorithm for Stochastic Online Sorting and TSP
Andreas Kalavas, Charalampos Platanos, Thanos Tolias
In \emph{Online Sorting}, an array of initially empty cells is given. At each time step , an element arrives and must be placed irrevocably into an empty cel…