4 papers
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…
An algorithm for accurate and simple-looking metaphorical maps
Eleni Katsanou, Tamara Mchedlidze, Antonios Symvonis +1
"Metaphorical maps" or "contact representations" are visual representations of vertex-weighted graphs that rely on the geographic map metaphor. The vertices are represented by coun…
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…
A Competitive Posted-Price Mechanism for Online Budget-Feasible Auctions
Andreas Charalampopoulos, Dimitris Fotakis, Panagiotis Patsilinakos +1
We consider online procurement auctions, where the agents arrive sequentially, in random order, and have private costs for their services. The buyer aims to maximize a monotone sub…