THE ALIGNED K-CENTER PROBLEM

DOI10.1142/S0218195911003597MaRDI QIDQ2999091zbMATH OpenOpenAlexFDO

Authors Christian Knauer, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron, Peter Brass

Publication date 11 May 2011

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195911003597

zbMATH Keywords

\(k\)-center problemapproximate algorithmrandomized algorithm

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• The p-neighbor k-center problem
• On the k-center problem with many centers
• The non-uniform k-center problem
• The Non-Uniform k -Center Problem
• The k-centrum straight-line location problem
• An Algorithm for the p-Center Problem in the Plane
• The Capacitated K-Center Problem
• Approximation algorithms for a \(k\)-line center
• scientific article; zbMATH DE number 1947381
• An approximation algorithm for k-center problem on a convex polygon

Cites work

• A data structure for dynamic trees
• An Optimal-Time Algorithm for Slope Selection
• APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
• Base station placement on boundary of a convex polygon
• Clustering motion
• Constrained minimum enclosing circle with center on a query line segment
• Exact and approximation algorithms for clustering
• Fast computation of smallest enclosing circle with center on a query line segment
• Generalized Selection and Ranking: Sorted Matrices
• Geometric applications of a randomized optimization technique
• Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
• Maintenance of a piercing set for intervals with applications
• On the Complexity of Some Common Geometric Location Problems
• On the complexity of some geometric problems in unbounded dimension
• Optimal packing and covering in the plane are NP-complete
• Randomized optimal algorithm for slope selection
• The slab dividing approach to solve the Euclidean \(P\)-center problem
• VARIATIONS OF BASE-STATION PLACEMENT PROBLEM ON THE BOUNDARY OF A CONVEX REGION

Cited in

(19)

• On the k-center problem with many centers
• Approximation algorithms for aligning points
• Approximating k-orthogonal line center
• The coverage problem by aligned disks
• Computing the line-constrained k-center in the plane for small k
• Line-constrained k-median, k-means, and k-center problems in the plane
• Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane
• scientific article; zbMATH DE number 1947381 (Why is no real title available?)
• Computing the rectilinear center of uncertain points in the plane
• Efficient algorithms for the one-dimensional \(k\)-center problem
• An \(O(n\log n)\)-time algorithm for the \(k\)-center problem in trees
• Computing the center of uncertain points on tree networks
• Approximation algorithms for aligning points
• An O(n n)-time algorithm for the k-center problem in trees
• Approximation algorithms for orthogonal line centers
• Improved separated red-blue center clustering
• The Coverage Problem by Aligned Disks
• Variants of Euclidean k-center clusterings
• The K-prize-collecting coverage problem by aligned disks

This page was built for publication: THE ALIGNED K-CENTER PROBLEM

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