An $O(\log \log n)$-approximate budget feasible mechanism for subadditive valuations

Documenti analoghi

• Multidimensional Budget-Feasible Mechanism Design
  di: Neogi, Rian, et al.
  Pubblicazione: (2025)
• An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding
  di: Ibrahimpur, Sharat, et al.
  Pubblicazione: (2025)
• Approximation Algorithms for Correlated Knapsack Orienteering
  di: Espinosa, David Aleman, et al.
  Pubblicazione: (2024)
• Deterministic Minimum Steiner Cut in Maximum Flow Time
  di: Ding, Matthew, et al.
  Pubblicazione: (2023)
• Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
  di: Eiben, Eduard, et al.
  Pubblicazione: (2023)