An efficient algorithm for the proximity connected two center problem

DOI10.1007/978-3-031-06678-8_15OpenAlexW4285135707MaRDI QIDQ2169955

Binay K. Bhattacharya, Thomas C. Shermer, Amirhossein Mozafari

Publication date: 30 August 2022

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

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• A faster algorithm for the two-center decision problem
• A fast algorithm for the alpha-connected two-center decision problem
• A near-linear algorithm for the planar 2-center problem
• Exact and approximation algorithms for clustering
• More planar two-center algorithms
• Efficient planar two-center algorithms
• Dynamic Voronoi diagrams
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• An Expander-Based Approach to Geometric Optimization
• 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