A multi-pass streaming algorithm for regularized submodular maximization

DOI10.1007/978-3-030-92681-6_55OpenAlexW4205550852MaRDI QIDQ2150592

Sui-Xiang Gao, Fengmin Wang, Ruiqi Yang, Qinqin Gong

Publication date: 29 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-92681-6_55

zbMATH Keywords

streaming algorithmssubmodular maximizationmulti-passstream modelthreshold-based

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• A note on maximizing a submodular set function subject to a knapsack constraint
• Bicriteria algorithms to balance coverage and cost in team formation under online model
• Constrained submodular maximization via greedy local search
• Improved Approximations for k-Exchange Systems
• A threshold of ln n for approximating set cover
• Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
• An analysis of approximations for maximizing submodular set functions—I
• Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
• Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid
• Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
• Guess free maximization of submodular and linear sums

This page was built for publication: A multi-pass streaming algorithm for regularized submodular maximization