On the Diameter of Lattice Polytopes

@article{Pia2016OnTD,
  title={On the Diameter of Lattice Polytopes},
  author={Alberto Del Pia and Carla Michini},
  journal={Discrete & Computational Geometry},
  year={2016},
  volume={55},
  pages={681-687}
}
In this paper we show that the diameter of a d-dimensional lattice polytope in [0, k] is at most ⌊( k − 1 2 ) d ⌋ . This result implies that the diameter of a d-dimensional half-integral polytope is at most ⌊ 3 2 d ⌋ . We also show that for half-integral polytopes the latter bound is tight for any d. 
Related Discussions
This paper has been referenced on Twitter 3 times. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 15 references

On the diameter of convex polytopes

Discrete Mathematics • 1992
View 6 Excerpts
Highly Influenced

Integer Programming: Methods, Uses, Computation

50 Years of Integer Programming • 2010
View 2 Excerpts

Theory of linear and integer programming

Wiley-Interscience series in discrete mathematics and optimization • 1999
View 1 Excerpt

Geometry of Cuts and Metrics

M. Laurent
Algorithms and Combinatorics. Springer, • 1997
View 1 Excerpt

Stable Matchings and Linear Inequalities

Discrete Applied Mathematics • 1994
View 2 Excerpts

On the Convex Hull of the Integer Points in a Disc

Symposium on Computational Geometry • 1990
View 2 Excerpts

Similar Papers

Loading similar papers…