A streaming algorithm for non-monotone regularized submodular maximization

DOI10.1016/J.ORL.2026.107456MaRDI QIDQ7285926zbMATH OpenFDO

Authors Hongyang Zhang, Wenchang Luo

Publication date 22 June 2026

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ORL.2026.107456

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• Best Algorithms for Approximating the Maximum of a Submodular Set Function
• Budget-constrained profit maximization without non-negative objective assumption in social networks
• Guess free maximization of submodular and linear sums
• scientific article; zbMATH DE number 3559283 (Why is no real title available?)
• Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
• On maximizing sums of non-monotone submodular and linear functions
• Optimal approximation for submodular and supermodular optimization with bounded curvature
• PASS approximation: a framework for analyzing and designing heuristics
• Regularized nonmonotone submodular maximization
• Streaming submodular maximization under matroid constraints

This page was built for publication: A streaming algorithm for non-monotone regularized submodular maximization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7285926)