Additive One Approximation for Minimum Degree Spanning Tree: Breaking the $O(mn)$ Time Barrier

Documenti analoghi

• Fully Dynamic $k$-Median with Near-Optimal Update Time and Recourse
  di: Bhattacharya, Sayan, et al.
  Pubblicazione: (2024)
• Deterministic $k$-Median Clustering in Near-Optimal Time
  di: Costa, Martín, et al.
  Pubblicazione: (2025)
• Breaking the O(mn)-Time Barrier for Vertex-Weighted Global Minimum Cut
  di: Chuzhoy, Julia, et al.
  Pubblicazione: (2025)
• Almost Optimal Fully Dynamic $k$-Center Clustering with Recourse
  di: Bhattacharya, Sayan, et al.
  Pubblicazione: (2024)
• Improved Approximation Algorithms for (1,2)-TSP and Max-TSP Using Path Covers in the Semi-Streaming Model
  di: Alipour, Sharareh, et al.
  Pubblicazione: (2025)