Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation

Documenti analoghi

• A $5/4$-Approximation for Two-Edge Connectivity
  di: Bosch-Calvo, Miguel, et al.
  Pubblicazione: (2024)
• A $4/3$ Approximation for $2$-Vertex-Connectivity
  di: Bosch-Calvo, Miguel, et al.
  Pubblicazione: (2023)
• Exact Algorithms for MaxCut on Split Graphs
  di: Lalovic, Marko
  Pubblicazione: (2024)
• On the Average-Case Performance of Greedy for Maximum Coverage
  di: Balkanski, Eric, et al.
  Pubblicazione: (2026)
• A Constant-factor Approximation for Weighted Bond Cover
  di: Kim, Eun Jung, et al.
  Pubblicazione: (2021)