17 citations · 45 across the 24 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015★ 4 cited
Dynamic Balanced Graph Partitioning
Chen Avin, Marcin Bienkowski, Andreas Loukas +2
This paper initiates the study of the classic balanced graph partitioning problem from an online perspective: Given an arbitrary sequence of pairwise communication requests between…
cs.DS2015
Online Algorithms for Multi-Level Aggregation
Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka +7
In the Multi-Level Aggregation Problem (MLAP), requests arrive at the nodes of an edge-weighted tree T, and have to be served eventually. A service is defined as a subtree X of T t…