Two Complexity Results on Spanning-Tree Congestion Problems

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)
• Approximation of Spanning Tree Congestion using Hereditary Bisection
  di: Kolman, Petr
  Pubblicazione: (2024)
• Lower Bounds for Adaptive Relaxation-Based Algorithms for Single-Source Shortest Paths
  di: Atalig, Sunny, et al.
  Pubblicazione: (2024)
• A 3.3904-Competitive Online Algorithm for List Update with Uniform Costs
  di: Basiak, Mateusz, et al.
  Pubblicazione: (2025)
• Speed-robust scheduling revisited
  di: Minařík, Josef, et al.
  Pubblicazione: (2024)