Michalis Xefteris

activity

20222026

most citedLearning-Augmented Online TSP on Rings, Trees, Flowers and (almost) Everywhere Else

2 citations · 2 across the 8 of their papers we have counts for

collaborators

Showing 2024Show all

2 papers · 1 filter

cs.DS2024

Improved FPT Approximation for Non-metric TSP

Evripidis Bampis, Bruno Escoffier, Michalis Xefteris

In the Traveling Salesperson Problem (TSP) we are given a list of locations and the distances between each pair of them. The goal is to find the shortest possible tour that visits…

cs.DS2024

Parsimonious Learning-Augmented Approximations for Dense Instances of $NP$ -hard Problems

Evripidis Bampis, Bruno Escoffier, Michalis Xefteris

The classical work of (Arora et al., 1999) provides a scheme that gives, for any $ε > 0$ , a polynomial time $1 - ε$ approximation algorithm for dense instances of a family of $\mathcal…

Improved FPT Approximation for Non-metric TSP

Parsimonious Learning-Augmented Approximations for Dense Instances of NP-hard Problems

Parsimonious Learning-Augmented Approximations for Dense Instances of $NP$ -hard Problems