Approximation algorithm for the kinetic robust \(k\)-center problem

DOI10.1016/j.comgeo.2010.01.001zbMath1196.65102OpenAlexW2091170478MaRDI QIDQ982946

Sorelle A. Friedler, David M. Mount

Publication date: 28 July 2010

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2010.01.001

zbMATH Keywords

algorithmclusteringrobust statisticskinetic data structures\(k\)-center problemexponential complexity

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Numerical mathematical programming methods (65K05) Stochastic programming (90C15)

Related Items (5)

Topological stability of kinetic \(k\)-centers ⋮ A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the Impossibility of Dimension Reduction for Doubling Subsets of $\ell_{p}$

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Clustering to minimize the maximum intercluster distance
• Some dynamic computational geometry problems
• A heuristic for the p-center problem in graphs
• Fast algorithms for collision and proximity problems involving moving geometric objects
• Clustering motion
• Approximate range searching: The absolute model
• Deformable spanners and applications
• Searching dynamic point sets in spaces with bounded doubling dimension
• Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
• The Kinetic Facility Location Problem
• An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
• An Optimal Dynamic Spanner for Doubling Metric Spaces
• Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
• A Best Possible Heuristic for the k-Center Problem
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• On the computational complexity of centers locating in a graph
• Data Structures for Mobile Data
• Voronoi Diagrams of Moving Points

This page was built for publication: Approximation algorithm for the kinetic robust \(k\)-center problem