Approximation Algorithms for Size-Constrained Non-Monotone Submodular Maximization in Deterministic Linear Time-Reference-Cited by-同舟云学术

Approximation Algorithms for Size-Constrained Non-Monotone Submodular Maximization in Deterministic Linear Time

Published:2023-08-04 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
language:
Short-container-title:

Author:

Chen Yixin¹^ORCID,Kuhnle Alan¹^ORCID

Affiliation:

1. Texas A&M University, College Station, TX, USA

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3580305.3599259

Reference34 articles.

1. Naor Alaluf , Alina Ene , Moran Feldman , Huy L. Nguyen , and Andrew Suh . 2020 . Optimal streaming algorithms for submodular maximization with cardinality constraints. In 47th International Colloquium on Automata, Languages, and Programming (ICALP). https://doi.org/10 .4230/LIPIcs.ICALP.2020.6 arxiv: 1909.13676 10.4230/LIPIcs.ICALP.2020.6 Naor Alaluf, Alina Ene, Moran Feldman, Huy L. Nguyen, and Andrew Suh. 2020. Optimal streaming algorithms for submodular maximization with cardinality constraints. In 47th International Colloquium on Automata, Languages, and Programming (ICALP). https://doi.org/10.4230/LIPIcs.ICALP.2020.6 arxiv: 1909.13676

2. Georgios Amanatidis , Federico Fusco , Philip Lazos , Stefano Leonardi , and Rebecca Reiffenhä user. 2020. Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint. arXiv ( 2020 ), 1--23. arxiv: 2007.05014 Georgios Amanatidis, Federico Fusco, Philip Lazos, Stefano Leonardi, and Rebecca Reiffenhä user. 2020. Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint. arXiv (2020), 1--23. arxiv: 2007.05014

3. Ashwinkumar Badanidiyuru Baharan Mirzasoleiman Amin Karbasi and Andreas Krause. 2014. Streaming Submodular Maximization: Massive Data Summarization on the Fly. In ACM SIGKDD Knowledge Discovery and Data Mining (KDD). 671--680. https://doi.org/10.1145/2623330.2623637 10.1145/2623330.2623637

4. Ashwinkumar Badanidiyuru Baharan Mirzasoleiman Amin Karbasi and Andreas Krause. 2014. Streaming Submodular Maximization: Massive Data Summarization on the Fly. In ACM SIGKDD Knowledge Discovery and Data Mining (KDD). 671--680. https://doi.org/10.1145/2623330.2623637

5. Fast algorithms for maximizing submodular functions

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Cost-Efficient Fraud Risk Optimization with Submodularity in Insurance Claim;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24