A quick estimate for the volume of a polyhedron

Type: Preprint

Publication Date: 2021-12-12

Citations: 0

Abstract

Let $P$ be a bounded polyhedron defined as the intersection of the non-negative orthant ${\Bbb R}^n_+$ and an affine subspace of codimension $m$ in ${\Bbb R}^n$. We show that a simple and computationally efficient formula approximates the volume of $P$ within a factor of $\gamma^m$, where $\gamma >0$ is an absolute constant. The formula provides the best known estimate for the volume of transportation polytopes from a wide family.

Locations

  • arXiv (Cornell University) - View - PDF

Similar Works

Action Title Year Authors
+ A quick estimate for the volume of a polyhedron 2021 Alexander Barvinok
Mark Rudelson
+ PDF Chat A quick estimate for the volume of a polyhedron 2024 Alexander Barvinok
Mark Rudelson
+ Complexity of Polytope Volume Computation 1993 Leonid Khachiyan
+ On The Complexity of Computing Mixed Volumes 1998 Martin Dyer
Peter Gritzmann
Alexander Hufnagel
+ Volume Computation for Polytopes: Strategies and Performances 2001 Andreas Enge
+ Volume Computation for Polytopes: Strategies and Performances 2008 Andreas Enge
+ PDF Chat A note on volume thresholds for random polytopes 2021 Debsoumya Chakraborti
Tomasz Tkocz
Beatrice-Helen Vritsiou
+ Chapter IV. Complexity of Polytope Volume Computation 1993 Leonid Khachiyan
+ Volumes of a random polytope in a convex set 1991 Leoni Dalla
D. G. Larman
+ PDF Chat Efficient computation of the volume of a polytope in high-dimensions using Piecewise Deterministic Markov Processes 2022 Augustin Chevallier
Frédéric Cazals
Paul Fearnhead
+ Das Volumen spezieller konvexer Polytope 1989 Horst Martini
+ Mixed volumes of polytopes 1992 U. Betke
+ PDF Chat Optimal area-sensitive bounds for polytope approximation 2012 Sunil Arya
Guilherme D. da Fonseca
David M. Mount
+ A simpler construction of volume polynomials for a polyhedron 2002 Serge Lawrencenko
Seiya Negami
I. Kh. Sabitov
+ Volumes in High Dimension 2002 Jiřı́ Matoušek
+ Optimal Bound on the Combinatorial Complexity of Approximating Polytopes 2022 Rahul Arya
Sunil Arya
Guilherme D. da Fonseca
David M. Mount
+ PDF Chat A bound for the number of vertices of a polytope with applications 2013 Alexander Barvinok
+ Chapter 2. What Is a Polyhedron? 2012
+ Chapter 2. What Is a Polyhedron? 2019
+ On Volumes of Non-Euclidean Polytopes 1994 Ruth Kellerhals

Works That Cite This (0)

Action Title Year Authors

Works Cited by This (0)

Action Title Year Authors