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. 2210.05965
  4. Cited By
Resolving the Approximability of Offline and Online Non-monotone
  DR-Submodular Maximization over General Convex Sets

Resolving the Approximability of Offline and Online Non-monotone DR-Submodular Maximization over General Convex Sets

12 October 2022
Loay Mualem
Moran Feldman
ArXiv (abs)PDFHTML

Papers citing "Resolving the Approximability of Offline and Online Non-monotone DR-Submodular Maximization over General Convex Sets"

4 / 4 papers shown
Title
Using Partial Monotonicity in Submodular Maximization
Using Partial Monotonicity in Submodular Maximization
Loay Mualem
Moran Feldman
33
8
0
07 Feb 2022
Optimal Algorithms for Continuous Non-monotone Submodular and
  DR-Submodular Maximization
Optimal Algorithms for Continuous Non-monotone Submodular and DR-Submodular Maximization
Rad Niazadeh
Tim Roughgarden
Joshua R. Wang
53
53
0
24 May 2018
Gradient Methods for Submodular Maximization
Gradient Methods for Submodular Maximization
Hamed Hassani
Mahdi Soltanolkotabi
Amin Karbasi
38
133
0
13 Aug 2017
Guarantees for Greedy Maximization of Non-submodular Functions with
  Applications
Guarantees for Greedy Maximization of Non-submodular Functions with Applications
Yatao Bian
J. M. Buhmann
Andreas Krause
Sebastian Tschiatschek
57
237
0
06 Mar 2017
1