Recommendations
- Minimum enclosing circle with few extra variables
- Constant work-space algorithms for facility location problems
- Selection from read-only memory with limited workspace
- Selection from read-only memory with limited workspace
- Fast and optimal parallel multidimensional search in PRAMs with applications to linear programming and related problems
Cites work
- scientific article; zbMATH DE number 3637614 (Why is no real title available?)
- scientific article; zbMATH DE number 1383709 (Why is no real title available?)
- A new polynomial-time algorithm for linear programming
- An O(nlogn) randomizing algorithm for the weighted euclidean 1-center problem
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Constant-work-space algorithms for geometric problems
- In-place algorithms for computing (Layers of) maxima
- Linear Programming in Linear Time When the Dimension Is Fixed
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Linear-time in-place selection in less than 3n comparisons
- Multi-pass geometric algorithms
- On the ball spanned by balls
- Selection from read-only memory and sorting with minimum data movement
- Small-dimensional linear programming and convex hulls made easy
- Space-efficient geometric divide-and-conquer algorithms
- Space-efficient planar convex hull algorithms
- Space-time trade-offs for stack-based algorithms
- The Ultimate Planar Convex Hull Algorithm?
- The Weighted Euclidean 1-Center Problem
- Towards in-place geometric algorithms and data structures
Cited in
(4)
This page was built for publication: Prune-and-search with limited workspace
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q473192)
