Improved Deterministic Algorithms for Linear Programming in Low Dimensions

DOI10.1137/1.9781611974331.ch84zbMath1414.90209OpenAlexW4239112803MaRDI QIDQ4575665

Timothy M. Chan

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974331.ch84

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05)

Related Items (3)

Deterministic Algorithms for Unique Sink Orientations of Grids ⋮ The complexity of optimization on grids ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg

This page was built for publication: Improved Deterministic Algorithms for Linear Programming in Low Dimensions