Improved algorithms for the bichromatic two-center problem for pairs of points

DOI10.1016/j.comgeo.2021.101806OpenAlexW3182407454MaRDI QIDQ824325

N. E. Zubov

Publication date: 15 December 2021

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2021.101806

zbMATH Keywords

facility locationgeometric optimizationbichromatic 2-center

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Computing methodologies and applications (68Uxx)

Cites Work

• Unnamed Item
• Unnamed Item
• A faster algorithm for the two-center decision problem
• The complexity of selection and ranking in X+Y and matrices with sorted columns
• A near-linear algorithm for the planar 2-center problem
• More planar two-center algorithms
• Bichromatic 2-center of pairs of points
• Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere
• Generalized Selection and Ranking: Sorted Matrices
• Finding tailored partitions
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
• Slowing down sorting networks to obtain faster sorting algorithms
• On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem

This page was built for publication: Improved algorithms for the bichromatic two-center problem for pairs of points