Improved algorithms for distributed balanced clustering

DOI10.1007/978-3-030-57852-7_6OpenAlexW3082525881MaRDI QIDQ1997266FDOQ1997266

Authors Kian Mirjalali, Hamid Zarrabi-Zadeh

Publication date 1 March 2021

Full work available at URL https://doi.org/10.1007/978-3-030-57852-7_6

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Theory of computing (68Qxx)

Recommendations

• On parameterized approximation algorithms for balanced clustering
• An improved density based distributed clustering
• Improved analysis of online balanced clustering
• Clustering with balancing constraints
• Faster balanced clusterings in high dimension
• Computing and Combinatorics
• A polynomial algorithm for balanced clustering via graph partitioning

Cites work

• Combining evidence for automatic web session identification

Cited in

(2)

• Massively parallel and streaming algorithms for balanced clustering
• Improved analysis of online balanced clustering

This page was built for publication: Improved algorithms for distributed balanced clustering

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