112 citations · 667 across the 96 of their papers we have counts for
Showing 2020 · cs.DSShow all
2 papers · 2 filters
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.DS2020
Improved Throughput for All-or-Nothing Multicommodity Flows with Arbitrary Demands
Anya Chaturvedi, Chandra Chekuri, Mengxue Liu +4
Throughput is a main performance objective in communication networks. This paper considers a fundamental maximum throughput routing problem -- the all-or-nothing multicommodity flo…