FPT Approximations for Connected Maximum Coverage

Documenti analoghi

• A Quadratic Vertex Kernel and a Subexponential Algorithm for Subset-FAST
  di: Jana, Satyabrata, et al.
  Pubblicazione: (2025)
• Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3
  di: Lokshtanov, Daniel, et al.
  Pubblicazione: (2024)
• Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints
  di: Inamdar, Tanmay, et al.
  Pubblicazione: (2024)
• Subexponential Parameterized Algorithms for Hitting Subgraphs
  di: Lokshtanov, Daniel, et al.
  Pubblicazione: (2024)
• Maximum Partial List H-Coloring on P_5-free graphs in polynomial time
  di: Lokshtanov, Daniel, et al.
  Pubblicazione: (2024)