On sub-determinants and the diameter of polyhedra

Details On sub-determinants and the diameter of polyhedra On sub-determinants and the diameter of polyhedra

2011-08-22

arxiv.org/abs/1108.4272v1

Mathematics

Combinatorics

Scientific paper

We derive a new upper bound on the diameter of a polyhedron P = {x \in R^n : Ax <= b}, where A \in Z^{m\timesn}. The bound is polynomial in n and the largest absolute value of a sub-determinant of A, denoted by \Delta. More precisely, we show that the diameter of P is bounded by O(\Delta^2 n^4 log n\Delta). If P is bounded, then we show that the diameter of P is at most O(\Delta^2 n^3.5 log n\Delta). For the special case in which A is a totally unimodular matrix, the bounds are O(n^4 log n) and O(n^3.5 log n) respectively. This improves over the previous best bound of O(m^16 n^3 (log mn)^3) due to Dyer and Frieze.

Affiliated with

Also associated with

No associations

Rating

On sub-determinants and the diameter of polyhedra does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On sub-determinants and the diameter of polyhedra, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On sub-determinants and the diameter of polyhedra will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-175843