111 citations · 131 across the 17 of their papers we have counts for
Showing 2021 · cs.DSShow all
2 papers · 2 filters
cs.DS2021
Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic and Fast
Bernhard Haeupler, D Ellis Hershkowitz, Thatchaphol Saranurak
Computing routing schemes that support both high throughput and low latency is one of the core challenges of network optimization. Such routes can be formalized as -length flows…
cs.DS2021★ 2 cited
Deterministic Tree Embeddings with Copies for Algorithms Against Adaptive Adversaries
Bernhard Haeupler, D Ellis Hershkowitz, Goran Zuzic
Embeddings of graphs into distributions of trees that preserve distances in expectation are a cornerstone of many optimization algorithms. Unfortunately, online or dynamic algorith…