scientific article; zbMATH DE number 1182931

MaRDI QIDQ4401028zbMATH OpenFDO

Authors Martin Dyer, Nimrod Megiddo

Publication date 19 January 1999

zbMATH Keywords

computational geometryparallel algorithmslinear time algorithmsfixed-dimensional linear programming

Mathematics Subject Classification ID

Linear programming (90C05) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Las Vegas algorithms for linear and integer programming when the dimension is small
• A Deterministic ${\operatorname{Poly}}(\log \log N)$-TimeN-Processor Algorithm for Linear Programming in Fixed Dimension
• A randomized algorithm for fixed-dimensional linear programming

Cited in

(11)

• Linear Time Algorithms for Two- and Three-Variable Linear Programs
• A randomized algorithm for fixed-dimensional linear programming
• Low-Dimensional Linear Programming with Violations
• Efficient algorithms for the minimum diameter bridge problem
• Walking around fat obstacles.
• Randomized combinatorial algorithms for linear programming when the dimension is moderately high
• On the space complexity of linear programming with preprocessing
• Data mapping of linear programming on fixed-size hypercubes
• Small-dimensional linear programming and convex hulls made easy
• Linear Programming in Linear Time When the Dimension Is Fixed
• scientific article; zbMATH DE number 437553 (Why is no real title available?)

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 Q4401028)