Two-stage non-submodular maximization

DOI10.1007/978-3-031-20350-3_22MaRDI QIDQ6111964zbMATH OpenFDO

Authors Hong Chang, Zhicheng Liu, Ping Li, Xiaoyan Zhang

Publication date 4 August 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-20350-3_22

zbMATH Keywords

curvaturegeneric submodularity ratiomatroid constrainttwo-stage submodular maximization

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A constrained two-stage 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
• Maximize a monotone function with a generic submodularity ratio
• Maximizing nonmonotone submodular functions under matroid or knapsack constraints
• New performance guarantees for the greedy maximization of submodular set functions
• Optimal value of information in graphical models
• 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: Two-stage non-submodular maximization

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