Français Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
Séminaire d'équipe(s) GALaC
Euler Polytopes and Convex Matroid Optimization
George Manoussakis

25 March 2016, 14h30 - 25 March 2016, 16h10
Salle/Bat : 435/PCRI-N
Contact :

Activités de recherche : Combinatoire

Résumé :
We introduce a novel family of polytopes strengthening bounds relevant to combinatorial optimization and convex matroid optimization. Del Pia and Michini recently improved the upper bound of kd due to Kleinschmidt and Onn for the largest possible diameter of the convex hull of a set of points in dimension d whose coordinates are integers between 0 and k. The introduced Euler polytopes include a family of lattice polytopes with diameter (k+1)d/2, and thus reduce the gap between the lower and upper bounds. In addition, we highlight connections between Euler polytopes and a parameter studied in convex matroid optimization, and strengthen the lower and upper bounds for this parameter.

Pour en savoir plus :
Séminaires
Resilient PDE solving approaches for exascale comp
Calcul à haute performance
Tuesday 29 May 2018 - 10h30
Salle : 465 - PCRI-N
Paul Mycek .............................................

Binary pattern of length greater than 14 are abeli
Combinatoire
Friday 25 May 2018 - 14h30
Salle : 445 - PCRI-N
Matthieu Rosenfeld .............................................

TBA
Algorithmique distribuée
Wednesday 02 May 2018 - 10h30
Salle : 465 - PCRI-N
Evangelos Bampas .............................................

Mariage stable auto-stabilisant et distribué
Théorie des graphes
Friday 13 April 2018 - 14h30
Salle : 445 - PCRI-N
Marie Laveau .............................................

Modélisation et implémentation du produit de matri
Calcul à haute performance
Wednesday 11 April 2018 - 10h30
Salle : 465 - PCRI-N
Thomas Lambert .............................................