Two-stage non-submodular maximization

DOI10.1007/978-3-031-20350-3_22MaRDI QIDQ6111964

Xiaoyan Zhang, Ping Li, Hong Chang, Zhi-cheng Liu

Publication date: 4 August 2023

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

zbMATH Keywords

curvaturematroid constraintgeneric submodularity ratiotwo-stage submodular maximization

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• 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
• Maximize a monotone function with a generic submodularity ratio
• A constrained two-stage submodular maximization
• Approximating the least core value and least core of cooperative games with supermodular costs
• Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
• Optimal Value of Information in Graphical Models
• An analysis of approximations for maximizing submodular set functions—I

This page was built for publication: Two-stage non-submodular maximization