scientific article; zbMATH DE number 437553
From MaRDI portal
Publication:3140430
Recommendations
- On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
- Improved deterministic algorithms for linear programming in low dimensions
- Improved deterministic algorithms for linear programming in low dimensions
- A randomized algorithm for fixed-dimensional linear programming
- scientific article; zbMATH DE number 1182931
Cited in
(20)- Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements
- Helly-type theorems and generalized linear programming
- Optimal slope selection via cuttings
- On geometric optimization with few violated constraints
- Almost optimal set covers in finite VC-dimension
- Randomized geometric algorithms and pseudorandom generators
- On the planar piecewise quadratic 1-center problem
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- A decision procedure for linear ``big O equations
- scientific article; zbMATH DE number 4141416 (Why is no real title available?)
- scientific article; zbMATH DE number 4161540 (Why is no real title available?)
- Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems
- On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
- Improved deterministic algorithms for linear programming in low dimensions
- Improved deterministic algorithms for linear programming in low dimensions
- Two-variable linear programming in parallel
- A Deterministic ${\operatorname{Poly}}(\log \log N)$-TimeN-Processor Algorithm for Linear Programming in Fixed Dimension
- Two-variable linear programming in parallel
- Diameter, width, closest line pair, and parametric searching
- Minimum-volume enclosing ellipsoids and core sets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3140430)
