Primitive Zonotopes
Autor: | Antoine Deza, George Manoussakis, Shmuel Onn |
---|---|
Přispěvatelé: | Graphes, Algorithmes et Combinatoire (LRI) (GALaC - LRI), Laboratoire de Recherche en Informatique (LRI), Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-Université Paris-Sud - Paris 11 (UP11)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS), Advanced Oprimization Laboratory, McMaster University [Hamilton, Ontario] |
Jazyk: | angličtina |
Rok vydání: | 2015 |
Předmět: |
Mathematics::Combinatorics
010102 general mathematics 0102 computer and information sciences [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG] 01 natural sciences Theoretical Computer Science Computational Theory and Mathematics 010201 computation theory & mathematics Optimization and Control (math.OC) FOS: Mathematics Discrete Mathematics and Combinatorics Mathematics::Metric Geometry Mathematics - Combinatorics Geometry and Topology Combinatorics (math.CO) 0101 mathematics Mathematics - Optimization and Control ComputingMilieux_MISCELLANEOUS 52B 90C |
Zdroj: | Discrete and Computational Geometry Discrete and Computational Geometry, Springer Verlag, 2018, 60, pp.27-39. ⟨10.1007/s00454-017-9873-z⟩ |
ISSN: | 0179-5376 1432-0444 |
DOI: | 10.1007/s00454-017-9873-z⟩ |
Popis: | We introduce and study a family of polytopes which can be seen as a generalization of the permutahedron of type $B_d$. We highlight connections with the largest possible diameter of the convex hull of a set of points in dimension $d$ whose coordinates are integers between $0$ and $k$, and with the computational complexity of multicriteria matroid optimization. The title was slightly modified, and the determination of the computational complexity of multicriteria matroid optimization was added |
Databáze: | OpenAIRE |
Externí odkaz: |