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. 1910.05646
  4. Cited By
"Bring Your Own Greedy"+Max: Near-Optimal $1/2$-Approximations for
  Submodular Knapsack

"Bring Your Own Greedy"+Max: Near-Optimal 1/21/21/2-Approximations for Submodular Knapsack

12 October 2019
Dmitrii Avdiukhin
G. Yaroslavtsev
Samson Zhou
ArXivPDFHTML

Papers citing ""Bring Your Own Greedy"+Max: Near-Optimal $1/2$-Approximations for Submodular Knapsack"

14 / 14 papers shown
Title
Theoretically Grounded Pruning of Large Ground Sets for Constrained,
  Discrete Optimization
Theoretically Grounded Pruning of Large Ground Sets for Constrained, Discrete Optimization
Ankur Nath
Alan Kuhnle
34
0
0
23 Oct 2024
Sliding Window Bi-Objective Evolutionary Algorithms for Optimizing
  Chance-Constrained Monotone Submodular Functions
Sliding Window Bi-Objective Evolutionary Algorithms for Optimizing Chance-Constrained Monotone Submodular Functions
Xiankun Yan
Anneta Neumann
Frank Neumann
21
1
0
13 Jul 2024
Fair Submodular Cover
Fair Submodular Cover
Wenjing Chen
Shuo Xing
Samson Zhou
Victoria G. Crawford
37
2
0
05 Jul 2024
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
35
1
0
20 May 2024
Federated Combinatorial Multi-Agent Multi-Armed Bandits
Federated Combinatorial Multi-Agent Multi-Armed Bandits
Fares Fourati
Mohamed-Slim Alouini
Vaneet Aggarwal
FedML
33
5
0
09 May 2024
Optimizing Chance-Constrained Submodular Problems with Variable
  Uncertainties
Optimizing Chance-Constrained Submodular Problems with Variable Uncertainties
Xiankun Yan
A. Do
Feng Shi
Xiaoyu Qin
Frank Neumann
14
4
0
23 Sep 2023
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
Linear Query Approximation Algorithms for Non-monotone Submodular
  Maximization under Knapsack Constraint
Linear Query Approximation Algorithms for Non-monotone Submodular Maximization under Knapsack Constraint
Canh V. Pham
Tan D. Tran
Dung T. K. Ha
My T. Thai
8
8
0
17 May 2023
A Framework for Adapting Offline Algorithms to Solve Combinatorial
  Multi-Armed Bandit Problems with Bandit Feedback
A Framework for Adapting Offline Algorithms to Solve Combinatorial Multi-Armed Bandit Problems with Bandit Feedback
G. Nie
Yididiya Y. Nadew
Yanhui Zhu
Vaneet Aggarwal
Christopher J. Quinn
OffRL
17
13
0
30 Jan 2023
Ranking with submodular functions on a budget
Ranking with submodular functions on a budget
Guangyi Zhang
Nikolaj Tatti
Aristides Gionis
10
5
0
08 Apr 2022
Active Learning in Bayesian Neural Networks with Balanced Entropy
  Learning Principle
Active Learning in Bayesian Neural Networks with Balanced Entropy Learning Principle
J. Woo
42
11
0
30 May 2021
A General Framework for Fairness in Multistakeholder Recommendations
A General Framework for Fairness in Multistakeholder Recommendations
Harshal A. Chaudhari
Sangdi Lin
O. Linda
8
6
0
04 Sep 2020
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack
  Constraint
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
Georgios Amanatidis
Federico Fusco
Philip Lazos
S. Leonardi
Rebecca Reiffenhauser
27
46
0
09 Jul 2020
Submodular Maximization in Clean Linear Time
Submodular Maximization in Clean Linear Time
Wenxin Li
Moran Feldman
Ehsan Kazemi
Amin Karbasi
27
23
0
16 Jun 2020
1