Two-stage non-submodular maximization

DOI10.1016/J.TCS.2023.114017MaRDI QIDQ6132970zbMATH OpenFDO

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

Publication date 21 July 2023

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

curvaturematroid constraintgeneric submodularity ratiotwo-stage \(\gamma \)-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
• 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 Q6132970)