Lower Bounds for Adaptive Relaxation-Based Algorithms for Single-Source Shortest Paths

Documenti analoghi

• A Refutation of Elmasry's $\tilde{O}(m \sqrt{n})$-Time Algorithm for Single-Source Shortest Paths
  di: Atalig, Sunny, et al.
  Pubblicazione: (2025)
• Two Complexity Results on Spanning-Tree Congestion Problems
  di: Atalig, Sunny, et al.
  Pubblicazione: (2026)
• Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths
  di: Chitnis, Rajesh, et al.
  Pubblicazione: (2024)
• Adaptive BSTs for Single-Source and All-to-All Requests: Algorithms and Lower Bounds
  di: Shiran, Maryam
  Pubblicazione: (2025)
• Better Bounds for Semi-Streaming Single-Source Shortest Paths
  di: Assadi, Sepehr, et al.
  Pubblicazione: (2025)