Improved analysis of online balanced clustering

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

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

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

zbMATH Keywords

clusteringonline algorithmscompetitive analysisgraph partitioninggraver basisbalanced partitioning

Mathematics Subject Classification ID

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

Cites Work

• On an elementary proof of some asymptotic formulas in the theory of partitions
• Title not available (Why is that?)
• Balanced graph partitioning
• A Polylogarithmic Approximation of the Minimum Bisection
• Title not available (Why is that?)
• Title not available (Why is that?)
• Nonlinear discrete optimization. An algorithmic theory
• Online balanced repartitioning
• Dynamic Balanced Graph Partitioning
• Brief Announcement: Deterministic Lower Bound for Dynamic Balanced Graph Partitioning

Cited In (1)

• Improved algorithms for distributed balanced clustering

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)