The complexity of optimization on grids
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1962814 (Why is no real title available?)
- scientific article; zbMATH DE number 3244470 (Why is no real title available?)
- A subexponential bound for linear programming
- Algorithms – ESA 2005
- Deterministic algorithms for unique sink orientations of grids
- Dynamic programming with convexity, concavity and sparsity
- Finding the sink takes some time: An almost quadratic lower bound for finding the sink of unique sink oriented cubes
- Geometric applications of a matrix-searching algorithm
- Grid orientations, \((d,d+2)\)-polytopes, and arrangements of pseudolines
- Improved deterministic algorithms for linear programming in low dimensions
- Improved upper bounds for Random-Edge and Random-Jump on abstract cubes
- Jumping Doesn’t Help in Abstract Cubes
- On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
- One line and n points
- Oriented Matroids
- Random edge can be exponential on abstract cubes
- Unique sink orientations of grids
- Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\)
- Violator spaces: Structure and algorithms
Cited in
(5)
This page was built for publication: The complexity of optimization on grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2319631)