Linear programming — Randomization and abstract frameworks
From MaRDI portal
Publication:4593969
DOI10.1007/3-540-60922-9_54zbMath1380.90184OpenAlexW1533912360MaRDI QIDQ4593969
Publication date: 16 November 2017
Published in: STACS 96 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60922-9_54
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Nonlinear programming (90C30) Linear programming (90C05) Randomized algorithms (68W20)
Related Items (11)
Exact primitives for smallest enclosing ellipses ⋮ Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location ⋮ Clarkson's algorithm for violator spaces ⋮ A distributed simplex algorithm for degenerate linear programs and multi-agent assignments ⋮ The 2-center problem in three dimensions ⋮ Random sampling with removal ⋮ Unique sink orientations of grids ⋮ Helly-type theorems for approximate covering ⋮ Violator spaces: Structure and algorithms ⋮ Random edge can be exponential on abstract cubes ⋮ Learning fixed-dimension linear thresholds from fragmented data
This page was built for publication: Linear programming — Randomization and abstract frameworks
