research
∙
04/20/2023
Polylog-Competitive Algorithms for Dynamic Balanced Graph Partitioning for Ring Demands
The performance of many large-scale and data-intensive distributed syste...
share
research
∙
03/04/2023
Electrical Flows for Polylogarithmic Competitive Oblivious Routing
Oblivious routing is a well-studied distributed paradigm that uses stati...
research
∙
01/04/2023
Dynamic Maintenance of Monotone Dynamic Programs and Applications
Dynamic programming (DP) is one of the fundamental paradigms in algorith...
research
∙
04/19/2021
It's Good to Relax: Fast Profit Approximation for Virtual Networks with Latency Constraints
This paper proposes a new approximation algorithm for the offline Virtua...
research
∙
11/02/2020
Tight Bounds for Online Graph Partitioning
We consider the following online optimization problem. We are given a gr...
research
∙
07/05/2020
Compact Oblivious Routing in Weighted Graphs
The space-requirement for routing-tables is an important characteristic ...
research
∙
05/05/2020
The Expander Hierarchy and its Applications to Dynamic Graph Algorithms
We introduce a notion for hierarchical graph clustering which we call th...
research
∙
12/24/2018