3 papers
cs.DS2026
Two Complexity Results on Spanning-Tree Congestion Problems
Sunny Atalig, Marek Chrobak, Christoph Dürr +4
In the spanning-tree congestion problem (), we are given a graph , and the objective is to compute a spanning tree of that minimizes the maximum edge congestio…
cs.DS2025
A Refutation of Elmasry's -Time Algorithm for Single-Source Shortest Paths
Sunny Atalig, Marek Chrobak
In this note we examine the recent paper "Breaking the Bellman-Ford Shortest-Path Bound" by Amr Elmasry, where he presents an algorithm for the single-source shortest path problem…
cs.DS2024
Lower Bounds for Adaptive Relaxation-Based Algorithms for Single-Source Shortest Paths
Sunny Atalig, Alexander Hickerson, Arrdya Srivastav +2
We consider the classical single-source shortest path problem in directed weighted graphs. D.~Eppstein proved recently an lower bound for oblivious algorithms that use re…