Two-variable linear programming in parallel
From MaRDI portal
Publication:5959558
DOI10.1016/S0925-7721(01)00028-1zbMath0998.68191WikidataQ127482008 ScholiaQ127482008MaRDI QIDQ5959558
Publication date: 27 November 2002
Published in: Computational Geometry (Search for Journal in Brave)
Linear programming (90C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An optimal parallel algorithm for linear programming in the plane
- An optimally efficient selection algorithm
- Small-dimensional linear programming and convex hulls made easy
- Bounded-independance derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming
- Time bounds for selection
- A subexponential bound for linear programming
- Linear programming in \(O(n\times 3^{d^2})\) time
- Linear Time Algorithms for Two- and Three-Variable Linear Programs
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Linear Programming in Linear Time When the Dimension Is Fixed
- Parallel Merge Sort
- Las Vegas algorithms for linear and integer programming when the dimension is small
- Parallel algorithms for partitioning sorted sets and related problems
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
- A Deterministic ${\operatorname{Poly}}(\log \log N)$-TimeN-Processor Algorithm for Linear Programming in Fixed Dimension
