A faster algorithm for the two-center decision problem

DOI10.1016/0020-0190(93)90153-ZzbMath0776.68109OpenAlexW2021816456MaRDI QIDQ685492

J. E. Hershberger

Publication date: 17 October 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90153-z

zbMATH Keywords

clustering\(k\)-center problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (13)

Improved algorithms for the bichromatic two-center problem for pairs of points ⋮ The mixed center location problem ⋮ New algorithms for \(k\)-center and extensions ⋮ An efficient algorithm for the proximity connected two center problem ⋮ Discrete and mixed two-center problems for line segments ⋮ The Mixed Center Location Problem ⋮ Efficient \(k\)-center algorithms for planar points in convex position ⋮ BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES ⋮ Efficient planar two-center algorithms ⋮ Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares ⋮ A fast algorithm for the alpha-connected two-center decision problem ⋮ New Algorithms for k-Center and Extensions ⋮ On the planar two-center problem and circular hulls

Cites Work

• Unnamed Item
• On a circle placement problem
• A linear-time algorithm for a special case of disjoint set union
• On the Complexity of Some Common Geometric Location Problems
• Finding tailored partitions
• Geometric clusterings
• On the shape of a set of points in the plane

This page was built for publication: A faster algorithm for the two-center decision problem