activity
20102023
most citedOn the Approximability of the Traveling Salesman Problem with Line Neighborhoods

10 citations · 18 across the 11 of their papers we have counts for

collaborators
Showing cs.DSShow all

13 papers · 1 filter

cs.DS2021

A Novel Prediction Setup for Online Speed-Scaling

Antonios Antoniadis, Peyman Jabbarzade Ganje, Golnoosh Shahkarami

Given the rapid rise in energy demand by data centers and computing systems in general, it is fundamental to incorporate energy considerations when designing (scheduling) algorithm…

cs.DS2021

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds

Antonios Antoniadis, Christian Coester, Marek Eliáš +2

We study the online problem of minimizing power consumption in systems with multiple power-saving states. During idle periods of unknown lengths, an algorithm has to choose between…

cs.DS2021

Skeletons and Minimum Energy Scheduling

Antonios Antoniadis, Gunjan Kumar, Nikhil Kumar

Consider the problem where jobs, each with a release time, a deadline and a required processing time are to be feasibly scheduled in a single- or multi-processor setting so as…

cs.DS2020

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…

cs.DS2020

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…

cs.DS2020★ 10 cited

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…