scientific article; zbMATH DE number 871908
From MaRDI portal
Publication:4875177
Recommendations
- Parallel linear programming in fixed dimension almost surely in constant time
- Parallel approximation algorithms by positive linear programming
- Positive linear programming, parallel approximation and PCP's
- Using optimization to break the epsilon barrier: a faster and simpler width-independent algorithm for solving positive linear programs in parallel
- An optimal parallel algorithm for linear programming in the plane
- Lower bounds for parallel linear programming and other problems
- Efficient parallel linear programming
- A parallel algorithm for linear programming problems
- Decomposition of linear programs using parallel computation
- The convergence of parallel iteration algorithms for linear complementarity problems
Cited in
(5)- Efficiency of parallel macropipelined computations in partially blocked linear and 0?1 linear programming problems
- Two-variable linear programming in parallel
- Fast and optimal parallel multidimensional search in PRAMs with applications to linear programming and related problems
- Parallel linear programming in fixed dimension almost surely in constant time
- Two-variable linear programming in parallel
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 Q4875177)
