Massively parallel and streaming algorithms for balanced clustering

DOI10.1016/J.TCS.2023.114296MaRDI QIDQ6144020zbMATH OpenOpenAlexFDO

Authors Kian Mirjalali, Hamid Zarrabi-Zadeh

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

capacitated clusteringclusteringcoresetsmassively parallel computationstreaming model

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A Best Possible Heuristic for the k-Center Problem
• Centrality of trees for capacitated \(k\)-center
• Clustering to minimize the maximum intercluster distance
• Communication steps for parallel query processing
• Data stream clustering
• Data streams: algorithms and applications.
• Decomposable searching problems I. Static-to-dynamic transformation
• How to Allocate Network Centers
• scientific article; zbMATH DE number 6297759 (Why is no real title available?)
• Improved algorithms for distributed balanced clustering
• Incremental Clustering and Dynamic Information Retrieval
• Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
• The Capacitated K-Center Problem

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

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