On some geometric selection and optimization problems via sorted matrices
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 432796 (Why is no real title available?)
- scientific article; zbMATH DE number 432817 (Why is no real title available?)
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Finding kth paths and p-centers by generating and searching good data structures
- Finding tailored partitions
- Generalized Selection and Ranking: Sorted Matrices
- Getting around a lower bound for the minimum Hausdorff distance
- L-infinity interdistance selection by parametric search
- Maintenance of configurations in the plane
- The complexity of selection and ranking in X+Y and matrices with sorted columns
- The two-line center problem from a polar view: a new algorithm and data structure
- Time bounds for selection
Cited in
(7)- Covering a set of points in a plane using two parallel rectangles
- On some geometric selection and optimization problems via sorted matrices
- Continuous location of dimensional structures.
- Improved algorithms for placing undesirable facilities
- Minimum-width double-strip and parallelogram annulus
- An Expander-Based Approach to Geometric Optimization
- Minimum-width double-slabs and widest empty slabs in high dimensions
This page was built for publication: On some geometric selection and optimization problems via sorted matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1265327)
