A Better-Than-2 Approximation for the Directed Tree Augmentation Problem

Documenti analoghi

• A $\frac{4}{3}$-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs
  di: Neuwohner, Meike
  Pubblicazione: (2024)
• Approximation Schemes for Planar Graph Connectivity Problems
  di: Neuwohner, Meike, et al.
  Pubblicazione: (2025)
• Approximation Algorithms for Steiner Connectivity Augmentation
  di: Hathcock, Daniel, et al.
  Pubblicazione: (2023)
• Lattice Structure and Efficient Basis Construction for Strongly Connected Orientations
  di: Liu, Siyue, et al.
  Pubblicazione: (2026)
• Steiner Forest: A Simplified Better-Than-2 Approximation
  di: Gupta, Anupam, et al.
  Pubblicazione: (2025)