2 citations · 2 across the 3 of their papers we have counts for
4 papers
An Improved Quality Hierarchical Congestion Approximator in Near-Linear Time
Monika Henzinger, Robin Münk, Harald Räcke
A single-commodity congestion approximator for a graph is a compact data structure that approximately predicts the edge congestion required to route any set of single-commodity flo…
Tight Bounds for Online Balanced Partitioning in the Generalized Learning Model
Harald Räcke, Stefan Schmid, Ruslan Zabrodin
Resource allocation in distributed and networked systems such as the Cloud is becoming increasingly flexible, allowing these systems to dynamically adjust toward the workloads they…
Tight Bounds for Online Graph Partitioning
Monika Henzinger, Stefan Neumann, Harald Räcke +1
We consider the following online optimization problem. We are given a graph and each vertex of the graph is assigned to one of servers, where servers have capacity a…
Compact Oblivious Routing
Harald Räcke, Stefan Schmid
Oblivious routing is an attractive paradigm for large distributed systems in which centralized control and frequent reconfigurations are infeasible or undesired (e.g., costly). Ove…