Vangelis Paschos

发表

On the max k-vertex cover problem ∗

Federico Della Croce, F. D. Croce, V. Paschos, 2016 .

Laboratoire D'analyse Et Modélisation De Systèmes Pour L'aide À La Décision Cahier Du Lamsade 278 Efficient Approximation of Min Set Cover by " Low-complexity " Exponential Algorithms Efficient Approximation of Min Set Cover by " Low-complexity " Exponential Algorithms

Bruno Escoffier, Nicolas Bourgeois, B. Escoffier, 2022 .