Efficient \(k\)-center algorithms for planar points in convex position

DOI10.1007/978-3-031-38906-1_18MaRDI QIDQ6179418

Hee-Kap Ahn, Jaegun Lee, Jong Min Choi

Publication date: 16 January 2024

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Cites Work

• Unnamed Item
• Efficient algorithms for the one-dimensional \(k\)-center problem
• A faster algorithm for the two-center decision problem
• The slab dividing approach to solve the Euclidean \(P\)-center problem
• A near-linear algorithm for the planar 2-center problem
• Exact and approximation algorithms for clustering
• Geometric clustering in normed planes
• Data structures for halfplane proximity queries and incremental Voronoi diagrams
• Optimal shortest path queries in a simple polygon
• More planar two-center algorithms
• On the planar two-center problem and circular hulls
• Efficient planar two-center algorithms
• Finding tailored partitions
• Geometric clusterings
• On the shape of a set of points in the plane
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Off-Line Maintenance of Planar Configurations
• Dynamic Three-Dimensional Linear Programming
• Slowing down sorting networks to obtain faster sorting algorithms
• On Bisectors in Normed Spaces
• Faster distance-based representative skyline and \(k\)-center along Pareto front in the plane

This page was built for publication: Efficient \(k\)-center algorithms for planar points in convex position