Startseite Mathematik Edges versus circuits: a hierarchy of diameters in polyhedra
Artikel
Lizenziert
Nicht lizenziert Erfordert eine Authentifizierung

Edges versus circuits: a hierarchy of diameters in polyhedra

  • , EMAIL logo und
Veröffentlicht/Copyright: 13. Oktober 2016
Veröffentlichen auch Sie bei De Gruyter Brill

Abstract

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.


Communicated by: M. Joswig


Acknowledgements

We are grateful for the comments we receive from Raymond Hemmecke, Jon Lee, and Edward Kim regarding some of these constructions. We are also grateful to Jake Miller for his help during the crafting of this paper.

Funding

The first author was supported by the Humboldt Foundation. The second author was supported by an NSA grant. The third author acknowledges the support from the graduate program TopMath of the Elite Network of Bavaria and the TopMath Graduate Center of TUM Graduate School at Technische Universität München.

References

[1] A. Bachem, W. Kern, Linear programming duality. Springer 1992. MR1230380 Zbl 0757.9005010.1007/978-3-642-58152-6Suche in Google Scholar

[2] A. Björner, M. Las Vergnas, B. Sturmfels, N. White, G. M. Ziegler, Oriented matroids, volume 46 of Encyclopedia of Mathematics and its Applications. Cambridge Univ. Press 1999. MR1744046 Zbl 0944.5200610.1017/CBO9780511586507Suche in Google Scholar

[3] R. G. Bland, New finite pivoting rules for the simplex method. Math. Oper. Res. 2 (1977), 103–107. MR0459599 Zbl 0408.9005010.1287/moor.2.2.103Suche in Google Scholar

[4] S. Borgwardt, J. A. De Loera, E. Finhold, J. Miller, The hierarchy of circuit diameters and transportation polytopes. Discrete Applied Mathematics (2015). http://dx.doi.org/10.1016/j.dam.2015.10.01710.1016/j.dam.2015.10.017Suche in Google Scholar

[5] S. Borgwardt, E. Finhold, R. Hemmecke, On the circuit diameter of dual transportation polyhedra. SIAM J. Discrete Math. 29 (2015), 113–121. MR3300405 Zbl 0651445210.1137/140976868Suche in Google Scholar

[6] K. Fukuda, T. Terlaky, Criss-cross methods: a fresh view on pivot algorithms. Math. Programming79 (1997), 369–395. MR1464775 Zbl 0887.9011310.1007/BF02614325Suche in Google Scholar

[7] R. Hemmecke, S. Onn, R. Weismantel, A polynomial oracle-time algorithm for convex integer minimization. Math. Program. 126 (2011), 97–117. MR2764341 Zbl 1228.9005510.1007/s10107-009-0276-7Suche in Google Scholar

[8] E. D. Kim, F. Santos, An update on the Hirsch conjecture. Jahresber. Dtsch. Math.-Ver. 112 (2010), 73–98. MR2681516 Zbl 1252.0505210.1365/s13291-010-0001-8Suche in Google Scholar

[9] R. T. Rockafellar, The elementary vectors of a subspace of RN. In: Combinatorial Mathematics and its Applications (Proc. Conf., Univ. North Carolina, Chapel Hill, N.C., 1967), 104–127, Univ. North Carolina Press, Chapel Hill, N.C. 1969.Suche in Google Scholar

Received: 2014-11-18
Revised: 2016-3-27
Published Online: 2016-10-13
Published in Print: 2016-10-1

© 2016 by Walter de Gruyter Berlin/Boston

Heruntergeladen am 19.3.2026 von https://www.degruyterbrill.com/document/doi/10.1515/advgeom-2016-0020/html
Button zum nach oben scrollen