Dynamic DR-submodular maximization with linear costs over the integer lattice

DOI10.1007/978-981-97-7798-3_10MaRDI QIDQ7405616zbMATH OpenFDO

Authors Yuanyuan Qiang, Bin Liu

Publication date 2024

Full work available at URL https://doi.org/10.1007/978-981-97-7798-3_10

zbMATH Keywords

dynamic algorithmlattice submodularsubmodular maximization

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites work

• A fast double greedy algorithm for non-monotone DR-submodular function maximization
• Algorithms for influence maximization in socio-physical networks
• Discrete convex analysis
• Dynamic algorithms for matroid submodular maximization
• Guess free maximization of submodular and linear sums
• scientific article; zbMATH DE number 1256748 (Why is no real title available?)
• Maximizing monotone submodular functions over the integer lattice
• Optimal approximation for submodular and supermodular optimization with bounded curvature
• Sequence submodular maximization meets streaming
• Simultaneous approximation of multi-criteria submodular function maximization
• Submodular function maximization on the bounded integer lattice
• Submodular functions and optimization.
• The one-way communication complexity of submodular maximization with applications to streaming and robustness

This page was built for publication: Dynamic DR-submodular maximization with linear costs over the integer lattice

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