Finding short paths on polytopes by the shadow vertex algorithm

DOI10.1007/978-3-642-39206-1_24MaRDI QIDQ5326568zbMATH OpenOpenAlexFDO

Authors Tobias Brunsch, Heiko Röglin

Publication date 6 August 2013

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1304.7235

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Abstract: We show that the shadow vertex algorithm can be used to compute a short path between a given pair of vertices of a polytope P = {x : Ax leq b} along the edges of P, where A in R^{m imes n} is a real-valued matrix. Both, the length of the path and the running time of the algorithm, are polynomial in m, n, and a parameter 1/delta that is a measure for the flatness of the vertices of P. For integer matrices A in Z^{m imes n} we show a connection between delta and the largest absolute value Delta of any sub-determinant of A, yielding a bound of O(Delta^4 m n^4) for the length of the computed path. This bound is expressed in the same parameter Delta as the recent non-constructive bound of O(Delta^2 n^4 log (n Delta)) by Bonifas et al. For the special case of totally unimodular matrices, the length of the computed path simplifies to O(m n^4), which significantly improves the previously best known constructive bound of O(m^{16} n^3 log^3(mn)) by Dyer and Frieze.

Recommendations

• Solving totally unimodular LPs with the shadow vertex algorithm
• Short simplex paths in lattice polytopes
• On the shadow simplex method for curved polyhedra
• On the shadow simplex method for curved polyhedra
• On the length of monotone paths in polyhedra

Cited in

(16)

• Short simplex paths in lattice polytopes
• On circuit diameter bounds via circuit imbalances
• Geometric random edge
• Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting)
• The smoothed complexity of Frank-Wolfe methods via conditioning of random matrices and polytopes
• Solving totally unimodular LPs with the shadow vertex algorithm
• Smoothed analysis of the successive shortest path algorithm
• Walking in a Planar Poisson–Delaunay Triangulation: Shortcuts in the Voronoi Path
• Shortest reconfiguration of perfect matchings via alternating cycles
• On the shadow simplex method for curved polyhedra
• On circuit diameter bounds via circuit imbalances
• A spectral approach to polytope diameter
• Exponential lower bounds for many pivot rules for the simplex method
• On the efficiency of algebraic simplex algorithms for solving MDPs
• Upper and lower bounds on the smoothed complexity of the simplex method
• On the shadow simplex method for curved polyhedra

This page was built for publication: Finding short paths on polytopes by the shadow vertex algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326568)