Constrained submodular maximization: beyond 1/e

DOI10.1109/FOCS.2016.34MaRDI QIDQ6946475zbMATH OpenFDO

Authors Alina Ene, Huy Le Nguyen

Publication date 6 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2016.34

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cited in

(4)

• Optimal streaming algorithms for submodular maximization with cardinality constraints
• Separating coverage and submodular: maximization subject to a cardinality constraint
• Revisiting non-monotone regularized submodular maximization: bi-criteria and pass approximations
• Efficient deterministic algorithms for maximizing symmetric submodular functions

This page was built for publication: Constrained submodular maximization: beyond \(1/e\)

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