Intersecting disks using two congruent disks

DOI10.1007/978-3-030-79987-8_28OpenAlexW3176273763MaRDI QIDQ5918623

Jong Min Choi, Hee-Kap Ahn, Byeonguk Kang

Publication date: 22 March 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-79987-8_28

zbMATH Keywords

parametric searchdisk coveringeuclidean 2-center

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The slab dividing approach to solve the Euclidean \(P\)-center problem
• A near-linear algorithm for the planar 2-center problem
• Geometric applications of a randomized optimization technique
• Covering and piercing disks with two centers
• More planar two-center algorithms
• Efficient planar two-center algorithms
• The 2-Center Problem with Obstacles
• Finding tailored partitions
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Linear Programming in Linear Time When the Dimension Is Fixed
• Slowing down sorting networks to obtain faster sorting algorithms
• On the rectangularp-center problem
• The 2-center problem in three dimensions

This page was built for publication: Intersecting disks using two congruent disks