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. 2009.01947
  4. Cited By
Practical and Parallelizable Algorithms for Non-Monotone Submodular
  Maximization with Size Constraint

Practical and Parallelizable Algorithms for Non-Monotone Submodular Maximization with Size Constraint

3 September 2020
Yixing Chen
Alan Kuhnle
ArXivPDFHTML

Papers citing "Practical and Parallelizable Algorithms for Non-Monotone Submodular Maximization with Size Constraint"

2 / 2 papers shown
Title
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
38
2
0
21 Aug 2023
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