Two-stage BP maximization under p-matroid constraint

DOI10.1016/J.TCS.2024.114469MaRDI QIDQ6204535FDOQ6204535

Donglei Du, Jing Jin, Hong Chang, Xiaoyan Zhang, Zhicheng Liu

Publication date: 28 March 2024

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Parametric inference under constraints (62F30) Quantum computation (81P68) Maximum principles in context of PDEs (35B50) Methods of global Riemannian geometry, including PDE methods; curvature restrictions (53C21) Algorithms for approximation of functions (65D15) Moduli, classification: analytic theory; relations with modular forms (14J15)

Cites Work

• Title not available (Why is that?)
• An analysis of approximations for maximizing submodular set functions—I
• Stacked denoising autoencoders: learning useful representations in a deep network with a local denoising criterion
• Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
• Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
• New performance guarantees for the greedy maximization of submodular set functions
• Approximating the least core value and least core of cooperative games with supermodular costs
• A constrained two-stage submodular maximization

This page was built for publication: Two-stage BP maximization under \(p\)-matroid constraint

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