Preprint
Sep 2026
Exponential Lower Bounds for Integer-Weighted Shortest-Paths Preservers of DAGs
It is proved that there exist DAGs for which any shortest-paths preserving integer reweighting requires weights of size $2^{\Omega(n)}$, even when the DAG has very simple structure.
Michael Yi Wang, Nicole Wein
· 0 citations