A quasi-polynomial bound for the diameter of graphs of polyhedra

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

The diameter of the graph of a $d$-dimensional polyhedron with $n$ facets is at most $n^{\log d+2}$
2 pages

Keywords

Metric Geometry, Combinatorics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/152794

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/9204233
 http://arxiv.org/abs/math/9204233
 Bull. Amer. Math. Soc. (N.S.) 26 (1992) 315-316

Collections

arXiv