ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2405.12252
  4. Cited By
Enhanced Deterministic Approximation Algorithm for Non-monotone
  Submodular Maximization under Knapsack Constraint with Linear Query
  Complexity

Enhanced Deterministic Approximation Algorithm for Non-monotone Submodular Maximization under Knapsack Constraint with Linear Query Complexity

20 May 2024
Canh V. Pham
ArXivPDFHTML

Papers citing "Enhanced Deterministic Approximation Algorithm for Non-monotone Submodular Maximization under Knapsack Constraint with Linear Query Complexity"

1 / 1 papers shown
Title
Submodular Maximization subject to a Knapsack Constraint: Combinatorial
  Algorithms with Near-optimal Adaptive Complexity
Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
Georgios Amanatidis
Federico Fusco
Philip Lazos
S. Leonardi
A. M. Spaccamela
Rebecca Reiffenhauser
41
12
0
16 Feb 2021
1