24 citations · 28 across the 7 of their papers we have counts for
Showing cs.NIShow all
2 papers · 1 filter
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★ 1 cited
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…