The upper bound theorem for polytopes: An easy proof of its asymptotic version
From MaRDI portal
Publication:1900993
DOI10.1016/0925-7721(95)00013-YzbMath0831.68114OpenAlexW2088501747WikidataQ56047087 ScholiaQ56047087MaRDI QIDQ1900993
Publication date: 29 October 1995
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0925-7721(95)00013-y
Related Items (17)
The minimum convex container of two convex polytopes under translations ⋮ Voronoi diagrams of moving points in the plane and of lines in space: tight bounds for simple configurations ⋮ Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems ⋮ Efficiency of the estimate refinement method for polyhedral approximation of multidimensional balls ⋮ PROBABILISTIC ANALYSIS FOR DISCRETE ATTRIBUTES OF MOVING POINTS ⋮ Bounds on the complexity of halfspace intersections when the bounded faces have small dimension ⋮ Qualification Conditions in Semialgebraic Programming ⋮ Method for polyhedral approximation of a ball with an optimal order of growth of the facet structure cardinality ⋮ Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs ⋮ The Morse theory of Čech and Delaunay complexes ⋮ Exact Quantization of Multistage Stochastic Linear Problems ⋮ Asymptotic properties of the estimate refinement method in polyhedral approximation of multidimensional balls ⋮ A geometric lower bound on the extension complexity of polytopes based on the \(f\)-vector ⋮ Note on the complexity of the mixed-integer hull of a polyhedron ⋮ Ready, set, go! The Voronoi diagram of moving points that start from a line ⋮ Classification using proximity catch digraphs ⋮ Relative persistent homology
Cites Work
This page was built for publication: The upper bound theorem for polytopes: An easy proof of its asymptotic version
