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. 1902.10172
  4. Cited By
Near Optimal Algorithms for Hard Submodular Programs with Discounted
  Cooperative Costs

Near Optimal Algorithms for Hard Submodular Programs with Discounted Cooperative Costs

26 February 2019
Rishabh K. Iyer
J. Bilmes
ArXiv (abs)PDFHTML

Papers citing "Near Optimal Algorithms for Hard Submodular Programs with Discounted Cooperative Costs"

4 / 4 papers shown
Title
Fair Submodular Cover
Fair Submodular Cover
Wenjing Chen
Shuo Xing
Samson Zhou
Victoria G. Crawford
54
3
0
05 Jul 2024
Robust Submodular Minimization with Applications to Cooperative Modeling
Robust Submodular Minimization with Applications to Cooperative Modeling
Rishabh K. Iyer
19
1
0
25 Jan 2020
"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
Dmitrii Avdiukhin
G. Yaroslavtsev
Samson Zhou
55
35
0
12 Oct 2019
A Unified Framework of Constrained Robust Submodular Optimization with
  Applications
A Unified Framework of Constrained Robust Submodular Optimization with Applications
Rishabh K. Iyer
68
8
0
14 Jun 2019
1