Finding Short Paths on Polytopes by the Shadow Vertex Algorithm

DOI10.1007/978-3-642-39206-1_24zbMath1336.68260arXiv1304.7235OpenAlexW2132914290MaRDI QIDQ5326568

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

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

Related Items (8)

Geometric random edge ⋮ Smoothed Analysis of the Successive Shortest Path Algorithm ⋮ Shortest Reconfiguration of Perfect Matchings via Alternating Cycles ⋮ On circuit diameter bounds via circuit imbalances ⋮ 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 ⋮ On sub-determinants and the diameter of polyhedra ⋮ On the shadow simplex method for curved polyhedra

This page was built for publication: Finding Short Paths on Polytopes by the Shadow Vertex Algorithm