42 citations · 66 across the 21 of their papers we have counts for
26 papers · 1 filter
Emergency Vertex Cover
Eric Angel, Evangelos Bampas, Evripidis Bampis +4
The Minimum Vertex Cover problem is a fundamental combinatorial optimization problem, aiming to identify a minimum subset of vertices in a graph such that every edge is incident to…
Learning-Augmented Approximation for Unrelated-Machines Makespan Scheduling
Kaito Baba, Evripidis Bampis, Giorgos Mitropoulos
Recently, Antoniadis et al. (ICLR 2025) proposed a framework for incorporating predictions to approximate NP-hard selection problems. Despite its simplicity, this approach tightly…
Polynomial Time Learning-Augmented Algorithms for NP-hard Permutation Problems
Evripidis Bampis, Bruno Escoffier, Dimitris Fotakis +2
We consider a learning-augmented framework for NP-hard permutation problems. The algorithm has access to predictions telling, given a pair of elements, whether is before…
Competitive Query Minimization for Stable Matching with One-Sided Uncertainty
Evripidis Bampis, Konstantinos Dogeas, Thomas Erlebach +3
We study the two-sided stable matching problem with one-sided uncertainty for two sets of agents A and B, with equal cardinality. Initially, the preference lists of the agents in A…
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…
Parsimonious Learning-Augmented Approximations for Dense Instances of -hard Problems
Evripidis Bampis, Bruno Escoffier, Michalis Xefteris
The classical work of (Arora et al., 1999) provides a scheme that gives, for any , a polynomial time approximation algorithm for dense instances of a family of $\mathcal…