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. 1905.13272
  4. Cited By
Parallel Algorithm for Non-Monotone DR-Submodular Maximization

Parallel Algorithm for Non-Monotone DR-Submodular Maximization

30 May 2019
Alina Ene
Huy Le Nguyen
ArXiv (abs)PDFHTML

Papers citing "Parallel Algorithm for Non-Monotone DR-Submodular Maximization"

9 / 9 papers shown
Title
Improved Parallel Algorithm for Non-Monotone Submodular Maximization
  under Knapsack Constraint
Improved Parallel Algorithm for Non-Monotone Submodular Maximization under Knapsack Constraint
Tan D. Tran
Canh V. Pham
Dung T. K. Ha
Phuong N. H. Pham
56
0
0
06 Sep 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
54
2
0
21 Aug 2023
Scalable Distributed Algorithms for Size-Constrained Submodular
  Maximization in the MapReduce and Adaptive Complexity Models
Scalable Distributed Algorithms for Size-Constrained Submodular Maximization in the MapReduce and Adaptive Complexity Models
Tonmoy Dey
Yixing Chen
Alan Kuhnle
61
0
0
20 Jun 2022
Lazy and Fast Greedy MAP Inference for Determinantal Point Process
Lazy and Fast Greedy MAP Inference for Determinantal Point Process
Shinichi Hemmi
Taihei Oki
Shinsaku Sakaue
K. Fujii
Satoru Iwata
40
4
0
13 Jun 2022
Best of Both Worlds: Practical and Theoretically Optimal Submodular
  Maximization in Parallel
Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel
Yixin Chen
Tonmoy Dey
Alan Kuhnle
55
14
0
15 Nov 2021
Submodular + Concave
Submodular + Concave
Siddharth Mitra
Moran Feldman
Amin Karbasi
35
19
0
09 Jun 2021
Greedy Bayesian Posterior Approximation with Deep Ensembles
Greedy Bayesian Posterior Approximation with Deep Ensembles
A. Tiulpin
Matthew B. Blaschko
UQCVFedML
80
4
0
29 May 2021
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
61
12
0
16 Feb 2021
Practical and Parallelizable Algorithms for Non-Monotone Submodular
  Maximization with Size Constraint
Practical and Parallelizable Algorithms for Non-Monotone Submodular Maximization with Size Constraint
Yixing Chen
Alan Kuhnle
66
7
0
03 Sep 2020
1