Yu. Baryshnikov - On expected number of maximal points in polytopes

dmtcs:3547 - Discrete Mathematics & Theoretical Computer Science, January 1, 2007, DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07) - https://doi.org/10.46298/dmtcs.3547
On expected number of maximal points in polytopesArticle

Authors: Yu. Baryshnikov 1

  • 1 Alcatel-Lucent Bell Labs

We answer an old question: what are possible growth rates of the expected number of vector-maximal points in a uniform sample from a polytope.

https://doi.org/10.46298/dmtcs.3547
Source: HAL:hal-01184795v1
Volume: DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07)
Section: Proceedings
Published on: January 1, 2007
Imported on: May 10, 2017
Keywords: polytope,maximal points,growth rate,[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG]

1 Document citing this article

Share and export

Consultation statistics

This page has been seen 224 times.
This article's PDF has been downloaded 208 times.