Improved algorithms for the bichromatic two-center problem for pairs of points
type: Item
instance of: scholarly article
title: Improved algorithms for the bichromatic two-center problem for pairs of points
author: N. E. Zubov
published in: Computational Geometry
publication date: 2021-12-15T00:00:00Z
Mathematics Subject Classification ID: 68Uxx
Mathematics Subject Classification ID: 68Qxx
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 7445247
zbMATH Keywords: bichromatic 2-center
zbMATH Keywords: geometric optimization
zbMATH Keywords: facility location
MaRDI profile type: Publication
full work available at URL: j.comgeo.2021.101806
OpenAlex ID: W3182407454
cites work: Bichromatic 2-center of pairs of points
cites work: More planar two-center algorithms
cites work: On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
cites work: Slowing down sorting networks to obtain faster sorting algorithms
cites work: Q5452284
cites work: Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere
cites work: On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
cites work: Q5501789
cites work: The complexity of selection and ranking in X+Y and matrices with sorted columns
cites work: Generalized Selection and Ranking: Sorted Matrices
cites work: A faster algorithm for the two-center decision problem
cites work: Finding tailored partitions
cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: A near-linear algorithm for the planar 2-center problem
DOI: 10.1016/J.COMGEO.2021.101806
description: scientific article; zbMATH DE number 7445247