Skip to main content
eScholarship
Open Access Publications from the University of California

Edges versus circuits: A hierarchy of diameters in polyhedra

  • Author(s): Borgwardt, S
  • De Loera, JA
  • Finhold, E
  • et al.

Published Web Location

http://front.math.ucdavis.edu/1409.7638
No data is associated with this publication.
Abstract

© 2016 by Walter de Gruyter Berlin/Boston. The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and the theory of linear optimization. In this paper we continue the investigation initiated in [5] by introducing a vast hierarchy of generalizations to the notion of graph diameter. This hierarchy provides some interesting lower bounds for the usual graph diameter. After explaining the structure of the hierarchy and discussing these bounds, we focus on clearly explaining the differences and similarities among the many diameter notions of our hierarchy. Finally, we fully characterize the hierarchy in dimension two. It collapses into fewer categories, for which we exhibit the ranges of values that can be realized as diameters.

Item not freely available? Link broken?
Report a problem accessing this item