๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the complexity of computing the diameter of a polytope

โœ Scribed by Alan M. Frieze; Shang-Hua Teng

Publisher
Springer
Year
1994
Tongue
English
Weight
585 KB
Volume
4
Category
Article
ISSN
1016-3328

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the diameter of convex polytopes
On the diameter of convex polytopes
โœ Peter Kleinschmidt; Shmuel Onn ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 171 KB
A convex polytope of diameter one
A convex polytope of diameter one
โœ Arun K. Pujari; Ashok K. Mittal; S.K. Gupta ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 94 KB
The diameter of the acyclic Birkhoff pol
The diameter of the acyclic Birkhoff polytope
โœ Liliana Costa; C.M. da Fonseca; Enide Andrade Martins ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 186 KB
An upper bound for the diameter of a pol
An upper bound for the diameter of a polytope
โœ David Barnette ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 515 KB

The distance between two vertices of a polytope is the minimum number of edges in a path joining them. The diameter of a polytope is the greatest distance between two vertices of the polytope. We show that if P is a d-dimensional polytope with n facets, then the diameter of P is at most $ $-3(,r -d