Parallel linear programming in fixed dimension almost surely in constant time
From MaRDI portal
Parallel numerical computation (65Y05) Linear programming (90C05) Analysis of algorithms and problem complexity (68Q25) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Distributed algorithms (68W15)
Recommendations
- A Deterministic ${\operatorname{Poly}}(\log \log N)$-TimeN-Processor Algorithm for Linear Programming in Fixed Dimension
- scientific article; zbMATH DE number 871908
- Fast and optimal parallel multidimensional search in PRAMs with applications to linear programming and related problems
- Linear Programming in Linear Time When the Dimension Is Fixed
- Linear Programming with Two Variables Per Inequality in Poly-Log Time
Cited in
(8)- scientific article; zbMATH DE number 871908 (Why is no real title available?)
- Prefix graphs and their applications
- A Deterministic ${\operatorname{Poly}}(\log \log N)$-TimeN-Processor Algorithm for Linear Programming in Fixed Dimension
- Linear Programming with Two Variables Per Inequality in Poly-Log Time
- A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs
- Efficiency of parallel macropipelined computations in partially blocked linear and 0?1 linear programming problems
- Linear Programming in Linear Time When the Dimension Is Fixed
- Fast and optimal parallel multidimensional search in PRAMs with applications to linear programming and related problems
This page was built for publication: Parallel linear programming in fixed dimension almost surely in constant time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4299014)
