Massively parallel and streaming algorithms for balanced clustering

DOI10.1016/j.tcs.2023.114296OpenAlexW4388575918MaRDI QIDQ6144020

Hamid Zarrabi-Zadeh, Kian Mirjalali

Publication date: 5 January 2024

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114296

zbMATH Keywords

clusteringcapacitated clusteringmassively parallel computationcoresetsstreaming model

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Centrality of trees for capacitated \(k\)-center
• Clustering to minimize the maximum intercluster distance
• Improved algorithms for distributed balanced clustering
• Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
• A Best Possible Heuristic for the k-Center Problem
• Decomposable searching problems I. Static-to-dynamic transformation
• How to Allocate Network Centers
• The Capacitated K-Center Problem
• Communication Steps for Parallel Query Processing
• Incremental Clustering and Dynamic Information Retrieval
• Data stream clustering

This page was built for publication: Massively parallel and streaming algorithms for balanced clustering