Variants of Euclidean \(k\)-center clusterings

DOI10.1007/978-3-031-49190-0_15MaRDI QIDQ6591472

Shin Nakano

Publication date: 22 August 2024

zbMATH Keywords

algorithms\(k\)-center problem\(r\)-gathering problem

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient algorithms for the one-dimensional \(k\)-center problem
• Clustering to minimize the maximum intercluster distance
• The slab dividing approach to solve the Euclidean \(P\)-center problem
• Some variations on constrained minimum enclosing circle problem
• Capacitated center problems with two-sided bounds and outliers
• A PTAS for the cardinality constrained covering with unit balls
• Achieving anonymity via clustering
• Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane
• THE ALIGNED K-CENTER PROBLEM
• On the Complexity of Some Common Geometric Location Problems
• How to Allocate Network Centers
• The Capacitated K-Center Problem
• Capacitated k-Center Problem with Vertex Weights
• A Simple Algorithm for $r$-gatherings on the Line

This page was built for publication: Variants of Euclidean \(k\)-center clusterings