4 citations · 8 across the 14 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.DC2015
Hardness of Virtual Network Embedding with Replica Selection
Carlo Fuerst, Maciej Pacut, Stefan Schmid
Efficient embedding virtual clusters in physical network is a challenging problem. In this paper we consider a scenario where physical network has a structure of a balanced tree. T…