Maximizing stochastic set function under a matroid constraint from decomposition

DOI10.1007/s10878-024-01193-zzbMath1547.90165MaRDI QIDQ6621839

Dong-lei Du, Wenguo Yang, Shengminjie Chen, Sui-Xiang Gao

Publication date: 21 October 2024

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

zbMATH Keywords

lattice contention resolutionstochastic non-submodular maximizationweaker approximation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
• Submodular Stochastic Probing on Matroids
• Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
• An analysis of approximations for maximizing submodular set functions—I
• Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
• Stochastic Conditional Gradient++: (Non)Convex Minimization and Continuous Submodular Maximization
• Stochastic Submodular Cover with Limited Adaptivity
• A Unified Continuous Greedy Algorithm for Submodular Maximization
• Novel algorithms for maximum DS decomposition

This page was built for publication: Maximizing stochastic set function under a matroid constraint from decomposition