Two-variable linear programming in parallel
From MaRDI portal
Recommendations
- Two-variable linear programming in parallel
- Fast and optimal parallel multidimensional search in PRAMs with applications to linear programming and related problems
- Linear Programming with Two Variables Per Inequality in Poly-Log Time
- A Deterministic ${\operatorname{Poly}}(\log \log N)$-TimeN-Processor Algorithm for Linear Programming in Fixed Dimension
- Linear Time Algorithms for Two- and Three-Variable Linear Programs
Cites work
- A Deterministic ${\operatorname{Poly}}(\log \log N)$-TimeN-Processor Algorithm for Linear Programming in Fixed Dimension
- A subexponential bound for linear programming
- An optimal parallel algorithm for linear programming in the plane
- An optimally efficient selection algorithm
- Bounded-independance derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming
- scientific article; zbMATH DE number 437553 (Why is no real title available?)
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 107951 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 871908 (Why is no real title available?)
- Las Vegas algorithms for linear and integer programming when the dimension is small
- Linear programming in \(O(n\times 3^{d^2})\) time
- Linear Programming in Linear Time When the Dimension Is Fixed
- Linear Time Algorithms for Two- and Three-Variable Linear Programs
- Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
- Parallel algorithms for partitioning sorted sets and related problems
- Parallel Merge Sort
- Small-dimensional linear programming and convex hulls made easy
- Time bounds for selection
Cited in
(5)- Efficient median finding and its application to two-variable linear programming on mesh-connected computers with multiple broadcasting
- Fast and optimal parallel multidimensional search in PRAMs with applications to linear programming and related problems
- Linear Programming with Two Variables Per Inequality in Poly-Log Time
- Two-variable linear programming in parallel
- On simplex method with most-obtuse-angle rule and cosine rule
This page was built for publication: Two-variable linear programming in parallel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5959558)
