The distributed algorithms for the lower-bounded \(k\)-center clustering in metric space

DOI10.1016/J.TCS.2024.114975MaRDI QIDQ6658308

Xiaoliang Wu, Jinhui Xu, Qilong Feng, Ting Liang

Publication date: 8 January 2025

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

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

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Centrality of trees for capacitated \(k\)-center
• Clustering to minimize the maximum intercluster distance
• Easy and hard bottleneck location problems
• Algorithms for facility location problems with outliers. (Extended abstract)
• Achieving anonymity via clustering
• A Best Possible Heuristic for the k-Center Problem
• How to Allocate Network Centers
• The Capacitated K-Center Problem
• Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers
• Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction

This page was built for publication: The distributed algorithms for the lower-bounded \(k\)-center clustering in metric space

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