✦ LIBER ✦

A Tight Lower Bound for Computing the Diameter of a 3D Convex Polytope

✍ Scribed by Hervé Fournier; Antoine Vigneron

Publisher: Springer
Year: 2007
Tongue: English
Weight: 428 KB
Volume: 49
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-007-9010-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Lower Bound Theorem for Ehrhart Polyno

A Lower Bound Theorem for Ehrhart Polynomials of Convex Polytopes

✍ T. Hibi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 153 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

A lower bound on the number of sharp sha

A lower bound on the number of sharp shadow-boundaries of convex polytopes

✍ E. Makai; H. Martini 📂 Article 📅 1989 🏛 Springer Netherlands 🌐 English ⚖ 760 KB

On the complexity of computing the diame

On the complexity of computing the diameter of a polytope

✍ Alan M. Frieze; Shang-Hua Teng 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 585 KB

A Linear Bound On The Diameter Of The Tr

A Linear Bound On The Diameter Of The Transportation Polytope*

✍ Graham Brightwell; Jan van den Heuvel; Leen Stougie† 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 146 KB

A tight lower bound for the train revers

A tight lower bound for the train reversal problem

✍ Alok Aggarwal; Tom Leighton 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 319 KB