Improved analysis of online balanced clustering

DOI10.1007/978-3-030-92702-8_14OpenAlexW4206605094MaRDI QIDQ2085752

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

Publication date: 19 October 2022

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

zbMATH Keywords

clusteringcompetitive analysisonline algorithmsgraph partitioninggraver basisbalanced partitioning

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Balanced graph partitioning
• Nonlinear discrete optimization. An algorithmic theory
• Online balanced repartitioning
• On an elementary proof of some asymptotic formulas in the theory of partitions
• Dynamic Balanced Graph Partitioning
• A Polylogarithmic Approximation of the Minimum Bisection
• Brief Announcement: Deterministic Lower Bound for Dynamic Balanced Graph Partitioning

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