A faster algorithm for the two-center decision problem

DOI10.1016/0020-0190(93)90153-ZMaRDI QIDQ685492zbMATH OpenOpenAlexFDO

Authors John 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

\(k\)-center problemclustering

Mathematics Subject Classification ID

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

Recommendations

• A fast algorithm for the alpha-connected two-center decision problem
• More planar two-center algorithms
• Efficient planar two-center algorithms
• Simple \(O(n \log^{2} n)\) algorithms for the planar 2-center problem
• The discrete 2-center problem

Cites work

• A linear-time algorithm for a special case of disjoint set union
• Finding tailored partitions
• Geometric clusterings
• scientific article; zbMATH DE number 432848 (Why is no real title available?)
• On a circle placement problem
• On the Complexity of Some Common Geometric Location Problems
• On the shape of a set of points in the plane

Cited in

(21)

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

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

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