ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1806.03349
  4. Cited By
An Optimal Algorithm for Online Unconstrained Submodular Maximization

An Optimal Algorithm for Online Unconstrained Submodular Maximization

8 June 2018
Tim Roughgarden
Joshua R. Wang
ArXiv (abs)PDFHTML

Papers citing "An Optimal Algorithm for Online Unconstrained Submodular Maximization"

3 / 3 papers shown
A Unified Approach to Submodular Maximization Under Noise
A Unified Approach to Submodular Maximization Under Noise
Kshipra Bhawalkar
Yang Cai
Zhe Feng
Christopher Liaw
Tao Lin
119
0
0
24 Oct 2025
Online Non-Monotone DR-submodular Maximization
Online Non-Monotone DR-submodular MaximizationAAAI Conference on Artificial Intelligence (AAAI), 2019
Nguyen Kim Thang
Abhinav Srivastav
175
17
0
25 Sep 2019
Non-monotone DR-submodular Maximization: Approximation and Regret
  Guarantees
Non-monotone DR-submodular Maximization: Approximation and Regret Guarantees
C. Dürr
Nguyen Kim Thang
Abhinav Srivastav
Léo Tible
125
7
0
23 May 2019
1
Page 1 of 1