2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DS2020
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…
cs.NI2018★ 2 cited
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…