:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Rozenman, Amit Ganz, Kulik, Ariel, Schwartz, Roy, Singh, Mohit
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2605.03071
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Tight Competitive Ratio for Online Submodular Welfare Maximization
by: Ganz, Amit, et al.
Published: (2023)

Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint
by: Filmus, Yuval, et al.
Published: (2024)

Analysis of Two-variable Recurrence Relations with Application to Parameterized Approximations
by: Kulik, Ariel, et al.
Published: (2019)

Chasing Submodular Objectives, and Submodular Maximization via Cutting Planes
by: Buchbinder, Niv, et al.
Published: (2025)

Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems
by: Esmer, Barış Can, et al.
Published: (2024)

Submodular Maximization in Exactly $n$ Queries
by: Balkanski, Eric, et al.
Published: (2024)

Learning-Augmented Dynamic Submodular Maximization
by: Agarwal, Arpit, et al.
Published: (2023)

Regularized Unconstrained Weakly Submodular Maximization
by: Zhu, Yanhui, et al.
Published: (2024)

Maximizing the Minimum Eigenvalue in Constant Dimension
by: Brown, Adam, et al.
Published: (2024)

Consistent Submodular Maximization
by: Dütting, Paul, et al.
Published: (2024)

A Threshold Greedy Algorithm for Noisy Submodular Maximization
by: Chen, Wenjing, et al.
Published: (2023)

Improved Algorithms for Fair Matroid Submodular Maximization
by: Mahabadi, Sepideh, et al.
Published: (2026)

A Radius-Sensitive Approximation Algorithm for Connected Submodular Maximization
by: Cervenjak, Philip, et al.
Published: (2026)

Unsplittable Flow on a Short Path
by: Doron-Arad, Ilan, et al.
Published: (2024)

You (Almost) Can't Beat Brute Force for 3-Matroid Intersection
by: Doron-Arad, Ilan, et al.
Published: (2024)

Fine Grained Lower Bounds for Multidimensional Knapsack
by: Doron-Arad, Ilan, et al.
Published: (2024)

An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding
by: Doron-Arad, Ilan, et al.
Published: (2023)

Lower Bounds for Matroid Optimization Problems with a Linear Constraint
by: Doron-Arad, Ilan, et al.
Published: (2023)

Subquadratic Submodular Maximization with a General Matroid Constraint
by: Kobayashi, Yusuke, et al.
Published: (2024)

Improved Evolutionary Algorithms for Submodular Maximization with Cost Constraints
by: Zhu, Yanhui, et al.
Published: (2024)

Efficient Deterministic Algorithms for Maximizing Symmetric Submodular Functions
by: Wan, Zongqi, et al.
Published: (2024)

Fast Parallel Algorithms for Submodular $p$-Superseparable Maximization
by: Cervenjak, Philip, et al.
Published: (2023)

Fair Submodular Maximization over a Knapsack Constraint
by: Li, Lijun, et al.
Published: (2025)

Maximization of Approximately Submodular Functions
by: Horel, Thibaut, et al.
Published: (2024)

Fixed-Parameter Tractable Submodular Maximization over a Matroid
by: Nematollahi, Shamisa, et al.
Published: (2025)

Linear Submodular Maximization with Bandit Feedback
by: Chen, Wenjing, et al.
Published: (2024)

Online Two-Stage Submodular Maximization
by: Nikolaou, Iasonas, et al.
Published: (2025)

Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order
by: Buchbinder, Niv, et al.
Published: (2026)

Efficient Branch-and-Bound for Submodular Function Maximization under Knapsack Constraint
by: Hao, Yimin, et al.
Published: (2025)

A Note On Deterministic Submodular Maximization With Bounded Curvature
by: Li, Wenxin
Published: (2024)

Deletion Robust Submodular Maximization over Matroids
by: Dütting, Paul, et al.
Published: (2022)

The Cost of Consistency: Submodular Maximization with Constant Recourse
by: Dütting, Paul, et al.
Published: (2024)

Fully Dynamic Submodular Maximization over Matroids
by: Dütting, Paul, et al.
Published: (2023)

Scalable Fair Influence Blocking Maximization via Approximately Monotonic Submodular Optimization
by: Fang, Qiangpeng, et al.
Published: (2026)

Optimality of Non-Adaptive Algorithms in Online Submodular Welfare Maximization with Stochastic Outcomes
by: Udwani, Rajan
Published: (2024)

Mini-batch Submodular Maximization
by: Schwartzman, Gregory
Published: (2024)

Submodular Maximization under Supermodular Constraint: Greedy Guarantees
by: Srivastava, Ajitesh, et al.
Published: (2026)

Streaming Stochastic Submodular Maximization with On-Demand User Requests
by: Wang, Honglian, et al.
Published: (2026)

Practical Parallel Algorithms for Non-Monotone Submodular Maximization
by: Cui, Shuang, et al.
Published: (2023)

Submodular Maximization Subject to Uniform and Partition Matroids: From Theory to Practical Applications and Distributed Solutions
by: Kia, Solmaz S.
Published: (2025)