Regularized submodular maximization over integer lattice

DOI10.1007/978-981-95-0215-8_11MaRDI QIDQ6867282zbMATH OpenFDO

Authors Zhicheng Liu, Yang Lv, Yapu Zhang, Zhenning Zhang

Publication date 28 January 2026

Full work available at URL https://doi.org/10.1007/978-981-95-0215-8_11

zbMATH Keywords

greedyinteger latticelattice submodularoffline model

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• A 1/2-approximation algorithm for maximizing a non-monotone weak-submodular function on a bounded integer lattice
• A tight linear time (1/2)-approximation for unconstrained submodular maximization
• An analysis of approximations for maximizing submodular set functions—I
• Approximating the least core value and least core of cooperative games with supermodular costs
• scientific article; zbMATH DE number 3635849 (Why is no real title available?)
• Maximizing monotone submodular functions over the integer lattice
• Maximizing sums of non-monotone submodular and linear functions: understanding the unconstrained case
• New performance guarantees for the greedy maximization of submodular set functions
• On maximizing sums of non-monotone submodular and linear functions
• Submodular function maximization on the bounded integer lattice
• The regularized submodular maximization via the Lyapunov method

This page was built for publication: Regularized submodular maximization over integer lattice

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