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. 2405.13994
  4. Cited By
Practical $0.385$-Approximation for Submodular Maximization Subject to a
  Cardinality Constraint

Practical 0.3850.3850.385-Approximation for Submodular Maximization Subject to a Cardinality Constraint

22 May 2024
M. Tukan
Loay Mualem
Moran Feldman
ArXivPDFHTML

Papers citing "Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint"

4 / 4 papers shown
Title
Submodular Minimax Optimization: Finding Effective Sets
Submodular Minimax Optimization: Finding Effective Sets
Loay Mualem
Ethan R. Elenberg
Moran Feldman
Amin Karbasi
49
5
0
26 May 2023
Deterministic Approximation for Submodular Maximization over a Matroid
  in Nearly Linear Time
Deterministic Approximation for Submodular Maximization over a Matroid in Nearly Linear Time
Kai Han
Z. Cao
Shuang Cui
Benwei Wu
29
21
0
22 Oct 2020
Discrete Adversarial Attacks and Submodular Optimization with
  Applications to Text Classification
Discrete Adversarial Attacks and Submodular Optimization with Applications to Text Classification
Qi Lei
Lingfei Wu
Pin-Yu Chen
A. Dimakis
Inderjit S. Dhillon
Michael Witbrock
AAML
45
92
0
01 Dec 2018
Submodular meets Spectral: Greedy Algorithms for Subset Selection,
  Sparse Approximation and Dictionary Selection
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
Abhimanyu Das
David Kempe
141
485
0
19 Feb 2011
1