On some geometric selection and optimization problems via sorted matrices
From MaRDI portal
Publication:1265327
DOI10.1016/S0925-7721(98)00017-0zbMATH Open0904.68176OpenAlexW2092477607MaRDI QIDQ1265327FDOQ1265327
Gregory Shpitalnik, Alex Glozman, Klara Kedem
Publication date: 28 September 1998
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0925-7721(98)00017-0
Cites Work
- Title not available (Why is that?)
- Generalized Selection and Ranking: Sorted Matrices
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Maintenance of configurations in the plane
- Title not available (Why is that?)
- Finding kth paths and p-centers by generating and searching good data structures
- L-infinity interdistance selection by parametric search
- The complexity of selection and ranking in X+Y and matrices with sorted columns
- Finding tailored partitions
- Time bounds for selection
- The two-line center problem from a polar view: a new algorithm and data structure
- Getting around a lower bound for the minimum Hausdorff distance
- Title not available (Why is that?)
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
Recommendations
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)
