scientific article; zbMATH DE number 1182931

zbMATH Open0904.90115MaRDI QIDQ4401028FDOQ4401028

Authors: Martin Dyer, Nimrod Megiddo 

Publication date: 19 January 1999

Title of this publication is not available (Why is that?)

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

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)

Cited In (12)

• Linear Time Algorithms for Two- and Three-Variable Linear Programs
• A randomized algorithm for fixed-dimensional linear programming
• Linear programming using limited-precision oracles
• 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
• Title not available (Why is that?)

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)