Aristotelis Giannakos und Algorithms - Info zur Person

(1 - 11 von 17

)

1st Athens Colloquium on Algorithms and Complexity, Athens (Greece),...

resources.illc.uva.nl

... Optimization and Polynomial Time Approximation - Evripidis Bampis, Evry 18: :10 TBA - Aristotelis Giannakos, Paris-Dauphine ...

Author List - International Conference and Workshops on Algorithms ...www.walcom-conference.org › author_list

www.walcom-conference.org

... Antonios Symvonis (2009); Apurva Mudgal (2014); Arash Vaezi (2017); Arijit Bishnu (2010); Arindam Karmakar (2008,2010); Aristotelis Giannakos (2013) ...

Experimental Algorithms: 14th International Symposium, SEA 2015,...

books.google.de

This book constitutes the refereed proceedings of the 14th International Symposium on Experimental Algorithms, SEA 2015, held in Paris, France, in June/July...

Greedy algorithms for on-line set-covering dok FR123dok.net › Autres

123dok.net

Aristotelis Giannakos. †. , Vangelis Th. Paschos. †. Abstract. We study the following on-line model for set-covering: elements of a ground set of size n ...

ACAC '06

www.corelab.ntua.gr

1st Athens Colloquium on Algorithms and Complexity

Exact and superpolynomial approximation algorithms for Hal-Inriahal.inria.fr › hal

hal.inria.fr

Nicolas Bourgeois 1 Aristotelis Giannakos 2 Giorgio Lucarelli 3 Ioannis Milis 4 Vangelis Th Paschos 2. Détails. 1 SAMM - Statistique, Analyse et ...

Exact and superpolynomial approximation algorithms for the d…...

hal.archives-ouvertes.fr

The d… $k$-subgraph problem is a generalization of the maximum clique problem, in which we are given a graph and a positive integer k, and we search among...