10 citations · 18 across the 11 of their papers we have counts for
5 papers · 1 filter
Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop
Antonios Antoniadis, Matthias Englert, Nicolaos Matsakis +1
We consider the problem of managing the buffer of a shared-memory switch that transmits packets of unit value. A shared-memory switch consists of an input port, a number of output…
On Minimum Generalized Manhattan Connections
Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook +5
We consider minimum-cardinality Manhattan connected sets with arbitrary demands: Given a collection of points in the plane, together with a subset of pairs of points in (wh…
On the Approximability of the Traveling Salesman Problem with Line Neighborhoods
Antonios Antoniadis, Sándor Kisfaludi-Bak, Bundit Laekhanukit +1
We study the variant of the Euclidean Traveling Salesman problem where instead of a set of points, we are given a set of lines as input, and the goal is to find the shortest tour t…
Secretary and Online Matching Problems with Machine Learned Advice
Antonios Antoniadis, Themis Gouleakis, Pieter Kleer +1
The classical analysis of online algorithms, due to its worst-case nature, can be quite pessimistic when the input instance at hand is far from worst-case. Often this is not an iss…
Online metric algorithms with untrusted predictions
Antonios Antoniadis, Christian Coester, Marek Elias +2
Machine-learned predictors, although achieving very good results for inputs resembling training data, cannot possibly provide perfect predictions in all situations. Still, decision…