Two-stage BP maximization under \(p\)-matroid constraint

DOI10.1007/978-3-031-22105-7_40MaRDI QIDQ6113876

Dong-lei Du, Xiaoyan Zhang, Zhi-cheng Liu, Hong Chang

Publication date: 10 August 2023

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

zbMATH Keywords

curvaturesubmodular termsupermodular term\(p\)-matroid constrainttwo-stage bp maximization

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• 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 BP maximization under \(p\)-matroid constraint