Learning-augmented maximum independent set
We study the Maximum Independent Set (MIS) problem on general graphs within the
framework of learning-augmented algorithms. The MIS problem is known to be NP-hard and …
framework of learning-augmented algorithms. The MIS problem is known to be NP-hard and …
[PDF][PDF] Parsimonious learning-augmented approximations for dense instances of np-hard problems
E Bampis, B Escoffier… - arXiv preprint arXiv …, 2024 - raw.githubusercontent.com
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 NP-hard …
polynomial time 1− ϵ approximation algorithm for dense instances of a family of NP-hard …
Learning-Augmented Streaming Algorithms for Approximating MAX-CUT
We study learning-augmented streaming algorithms for estimating the value of MAX-CUT in
a graph. In the classical streaming model, while a $1/2$-approximation for estimating the …
a graph. In the classical streaming model, while a $1/2$-approximation for estimating the …
Parsimonious Learning-Augmented Approximations for Dense Instances of -hard Problems
E Bampis, B Escoffier, M Xefteris - arXiv preprint arXiv:2402.02062, 2024 - arxiv.org
The classical work of (Arora et al., 1999) provides a scheme that gives, for any $\epsilon>
0$, a polynomial time $1-\epsilon $ approximation algorithm for dense instances of a family …
0$, a polynomial time $1-\epsilon $ approximation algorithm for dense instances of a family …