On some geometric selection and optimization problems via sorted matrices
type: Item
instance of: scholarly article
title: On some geometric selection and optimization problems via sorted matrices
zbMATH Open document ID: 0904.68176
DOI: 10.1016/S0925-7721(98)00017-0
author: Alex Glozman
author: Gregory Shpitalnik
author: Klara Kedem
published in: Computational Geometry
publication date: 1998-09-28T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1203557
zbMATH Keywords: geometric selection
zbMATH Keywords: optimization
MaRDI profile type: Publication
cites work: Time bounds for selection
cites work: Getting around a lower bound for the minimum Hausdorff distance
cites work: Q3772828
cites work: Q3138951
cites work: The complexity of selection and ranking in X+Y and matrices with sorted columns
cites work: Finding kth paths and p-centers by generating and searching good data structures
cites work: Generalized Selection and Ranking: Sorted Matrices
cites work: Finding tailored partitions
cites work: The two-line center problem from a polar view: a new algorithm and data structure
cites work: Q3138929
cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms
cites work: Maintenance of configurations in the plane
cites work: L-infinity interdistance selection by parametric search
full work available at URL: s0925-7721(98)00017-0
OpenAlex ID: W2092477607
description: scientific article; zbMATH DE number 1203557