An efficient algorithm for the proximity connected two center problem

DOI10.1007/978-3-031-06678-8_15MaRDI QIDQ2169955zbMATH OpenOpenAlexFDO

Authors Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer

Publication date 30 August 2022

Full work available at URL https://arxiv.org/abs/2204.08754

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• A fast algorithm for the alpha-connected two-center decision problem
• A faster algorithm for the two-center decision problem
• A near-linear algorithm for the planar 2-center problem
• An Expander-Based Approach to Geometric Optimization
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Dynamic Voronoi diagrams
• Efficient planar two-center algorithms
• Exact and approximation algorithms for clustering
• scientific article; zbMATH DE number 6776481 (Why is no real title available?)
• scientific article; zbMATH DE number 6472586 (Why is no real title available?)
• Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
• More planar two-center algorithms
• Slowing down sorting networks to obtain faster sorting algorithms

This page was built for publication: An efficient algorithm for the proximity connected two center problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2169955)