A quasi-polynomial bound for the diameter of graphs of polyhedra
Metric Geometry
2008-02-03 v1 Combinatorics
Abstract
The diameter of the graph of a -dimensional polyhedron with facets is at most
Cite
@article{arxiv.math/9204233,
title = {A quasi-polynomial bound for the diameter of graphs of polyhedra},
author = {Gil Kalai and Daniel J. Kleitman},
journal= {arXiv preprint arXiv:math/9204233},
year = {2008}
}
Comments
2 pages