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
Distributed decision and verification by mobile ag
Algorithmique distribuée
Tuesday 22 January 2019 - 10h30
Salle : 465 - PCRI-N
Evangelos Bampas .............................................

Redundancy in Distributed Proofs
Algorithmique distribuée
Tuesday 04 December 2018 - 00h00
Salle : 465 - PCRI-N
Ami Paz .............................................

Some recent results on the integer linear programm
Théorie des graphes
Friday 30 November 2018 - 00h00
Salle : 445 - PCRI-N
Hung Nguyen .............................................

Scalable and exhaustive screening of metabolic fun
Wednesday 28 November 2018 - 11h00
Salle : 465 - PCRI-N
Clémence Frioux .............................................

De la sociologie *avec* des algorithmes à la socio
Friday 09 November 2018 - 14h30
Salle : 445 - PCRI-N
Christpohe Prieur .............................................