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. 2305.10292
  4. Cited By
Linear Query Approximation Algorithms for Non-monotone Submodular
  Maximization under Knapsack Constraint
v1v2 (latest)

Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint

17 May 2023
Canh V. Pham
Tan D. Tran
Dung T. K. Ha
My T. Thai
ArXiv (abs)PDFHTML

Papers citing "Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint"

2 / 2 papers shown
Title
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
Canh V. Pham
68
1
0
20 May 2024
Practical Parallel Algorithms for Non-Monotone Submodular Maximization
Practical Parallel Algorithms for Non-Monotone Submodular Maximization
Shuang Cui
Kai Han
Jing Tang
He Huang
Xueying Li
Aakas Zhiyuli
Han Li
59
2
0
21 Aug 2023
1