Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021
Improved Analysis of Online Balanced Clustering
Marcin Bienkowski, Martin Böhm, Martin Koutecký +3
In the online balanced graph repartitioning problem, one has to maintain a clustering of nodes into clusters, each having nodes. During runtime, an online…
cs.DS2017
Nested Convex Bodies are Chaseable
Nikhil Bansal, Martin Böhm, Marek Eliáš +2
In the Convex Body Chasing problem, we are given an initial point in and an online sequence of convex bodies . When we receive , we are required…