Note on two-stage BP maximization

DOI10.1142/S0129054125400040MaRDI QIDQ7263279zbMATH OpenFDO

Authors Hong Chang, Donglei Du, Chuchu Xu, Xiaoyan Zhang

Publication date 12 June 2026

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054125400040

zbMATH Keywords

BP maximizationreplacement greedy algorithmsupermodular curvaturetwo-stage

Mathematics Subject Classification ID

Quantum theory (81-XX) Operations research, mathematical programming (90-XX)

Cites work

• A constrained two-stage submodular maximization
• An analysis of approximations for maximizing submodular set functions—I
• An analysis of the greedy algorithm for the submodular set covering problem
• Approximating the least core value and least core of cooperative games with supermodular costs
• scientific article; zbMATH DE number 3173999 (Why is no real title available?)
• scientific article; zbMATH DE number 3591873 (Why is no real title available?)
• scientific article; zbMATH DE number 3635849 (Why is no real title available?)
• Maximizing nonmonotone submodular functions under matroid or knapsack constraints
• Stacked denoising autoencoders: learning useful representations in a deep network with a local denoising criterion
• Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem

This page was built for publication: Note on two-stage BP maximization

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