DR-submodular function maximization with adaptive stepsize

DOI10.1007/978-3-031-49190-0_25MaRDI QIDQ6591486zbMATH OpenFDO

Authors Yanfei Li, Min Li, Qian Liu, Yang Zhou

Publication date 22 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-49190-0_25

zbMATH Keywords

adaptive stepsizebinary searchcomputational complexityDR-submodular functions

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• A Unified Continuous Greedy Algorithm for Submodular Maximization
• An analysis of approximations for maximizing submodular set functions—I
• scientific article; zbMATH DE number 7255156 (Why is no real title available?)
• Maximizing a monotone submodular function subject to a matroid constraint
• Submodular function maximization via the multilinear relaxation and contention resolution schemes
• Unconstrained submodular maximization with constant adaptive complexity

Cited in

(1)

• Fast approximation algorithm for non-monotone DR-submodular maximization under size constraint

This page was built for publication: DR-submodular function maximization with adaptive stepsize

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