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. 2409.04415
  4. Cited By
Improved Parallel Algorithm for Non-Monotone Submodular Maximization
  under Knapsack Constraint

Improved Parallel Algorithm for Non-Monotone Submodular Maximization under Knapsack Constraint

6 September 2024
Tan D. Tran
Canh V. Pham
Dung T. K. Ha
Phuong N. H. Pham
ArXivPDFHTML

Papers citing "Improved Parallel Algorithm for Non-Monotone Submodular Maximization under Knapsack Constraint"

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