Improved analysis of online balanced clustering

DOI10.1007/978-3-030-92702-8_14MaRDI QIDQ2085752zbMATH OpenOpenAlexFDO

Authors Marcin Bienkowski, Martin Böhm, Martin Koutecký, Thomas Rothvoß, Jiří Sgall, Pavel Veselý

Publication date 19 October 2022

Full work available at URL https://arxiv.org/abs/2107.00145

zbMATH Keywords

balanced partitioningclusteringcompetitive analysisgraph partitioninggraver basisonline algorithms

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Recommendations

• An Improved Algorithm for Online Unit Clustering
• An improved algorithm for online unit clustering
• Improved algorithms for distributed balanced clustering
• Better bounds on online unit clustering
• Better bounds on online unit clustering
• On parameterized approximation algorithms for balanced clustering
• Faster balanced clusterings in high dimension
• An algorithm for online \(k\)-means clustering
• Online clustering with variable sized clusters

Cites work

• A Polylogarithmic Approximation of the Minimum Bisection
• Balanced graph partitioning
• Brief Announcement: Deterministic Lower Bound for Dynamic Balanced Graph Partitioning
• Dynamic balanced graph partitioning
• scientific article; zbMATH DE number 5485537 (Why is no real title available?)
• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• Nonlinear discrete optimization. An algorithmic theory
• On an elementary proof of some asymptotic formulas in the theory of partitions
• Online balanced repartitioning

Cited in

(4)

• Improved algorithms for distributed balanced clustering
• An improved approximation algorithm for dynamic minimum linear arrangement
• A subquadratic bound for online bisection
• Improved bounds for online balanced graph re-partitioning

This page was built for publication: Improved analysis of online balanced clustering

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