Maximizing the differences between a monotone DR-submodular function and a linear function on the integer lattice

DOI10.1007/s40305-022-00393-wMaRDI QIDQ6601974

Dong-lei Du, Zhenning Zhang, Dan Wu, Ran Ma

Publication date: 11 September 2024

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

zbMATH Keywords

integer latticesubmodular maximizationstreaming algorithmDR-submodularsingle-threshold greedy algorithm

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• A note on maximizing a submodular set function subject to a knapsack constraint
• Maximizing monotone submodular functions over the integer lattice
• Non-submodular maximization on massive data streams
• An analysis of approximations for maximizing submodular set functions—I
• Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
• Guess free maximization of submodular and linear sums

This page was built for publication: Maximizing the differences between a monotone DR-submodular function and a linear function on the integer lattice