Improved approximation algorithm for the distributed lower-bounded k-center problem

DOI10.1007/978-981-97-2340-9_26MaRDI QIDQ6636095zbMATH OpenFDO

Authors Ting Liang, Qilong Feng, Xiaoliang Wu, Jinhui Xu, Jianxin Wang

Publication date 12 November 2024

zbMATH Keywords

approximation algorithm\(k\)-centerlower-bounded \(k\)-center

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Best Possible Heuristic for the k-Center Problem
• Achieving anonymity via clustering
• Algorithms for facility location problems with outliers. (Extended abstract)
• Approximation algorithms for clustering problems with lower bounds and outliers
• Centrality of trees for capacitated \(k\)-center
• Cluster analysis: unsupervised learning via supervised learning with a non-convex penalty
• Clustering to minimize the maximum intercluster distance
• Massively parallel and dynamic algorithms for minimum size clustering
• Privacy preserving clustering with constraints
• The non-uniform \(k\)-center problem

This page was built for publication: Improved approximation algorithm for the distributed lower-bounded \(k\)-center problem

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