112 citations · 667 across the 96 of their papers we have counts for
3 papers · 2 filters
Weighted Packet Selection for Rechargeable Links: Complexity and Approximation
Stefan Schmid, Jakub Svoboda, Michelle Yeo
We consider a natural problem dealing with weighted packet selection across a rechargeable link, which e.g., finds applications in cryptocurrency networks. The capacity of a link $…
Deterministic Self-Adjusting Tree Networks Using Rotor Walks
Chen Avin, Marcin Bienkowski, Iosif Salem +3
We revisit the design of self-adjusting single-source tree networks. The problem can be seen as a generalization of the classic list update problem to trees, and finds applications…
Fast and Heavy Disjoint Weighted Matchings for Demand-Aware Datacenter Topologies
Kathrin Hanauer, Monika Henzinger, Stefan Schmid +1
Reconfigurable optical topologies promise to improve the performance in datacenters by dynamically optimizing the physical network in a demand-aware manner. State-of-the-art optica…