3 citations · 3 across the 1 of their papers we have counts for
3 papers
cs.NI2021
It's Good to Relax: Fast Profit Approximation for Virtual Networks with Latency Constraints
Robin Münk, Matthias Rost, Stefan Schmid +1
This paper proposes a new approximation algorithm for the offline Virtual Network Embedding Problem (VNEP) with latency constraints. Given is a set of virtual networks with computa…
cs.NI2020
Compact Oblivious Routing in Weighted Graphs
Philipp Czerner, Harald Räcke
The space-requirement for routing-tables is an important characteristic of routing schemes. For the cost-measure of minimizing the total network load there exist a variety of resul…
cs.DS2020★ 3 cited
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms
Gramoz Goranci, Harald Räcke, Thatchaphol Saranurak +1
We introduce a notion for hierarchical graph clustering which we call the expander hierarchy and show a fully dynamic algorithm for maintaining such a hierarchy on a graph with …