Parameterized Approximation for Capacitated $d$-Hitting Set with Hard Capacities

Documenti analoghi

• Subexponential Parameterized Algorithms for Hitting Subgraphs
  di: Lokshtanov, Daniel, et al.
  Pubblicazione: (2024)
• Efficient Approximation of Fractional Hypertree Width
  di: Korchemna, Viktoriia, et al.
  Pubblicazione: (2024)
• A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs
  di: S, Ajaykrishnan E, et al.
  Pubblicazione: (2025)
• Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints
  di: Inamdar, Tanmay, et al.
  Pubblicazione: (2024)
• Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3
  di: Lokshtanov, Daniel, et al.
  Pubblicazione: (2024)