Adaptive robust submodular optimization and beyond

DOI10.1007/978-3-030-57602-8_17zbMath1485.90086OpenAlexW3047955721MaRDI QIDQ2039658

Jing Yuan, Shaojie Tang

Publication date: 5 July 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-57602-8_17

zbMATH Keywords

matroid constraintreward functionsworst case value

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Robustness in mathematical programming (90C17)

Related Items (1)

Uncertainty in Study of Social Networks: Robust Optimization and Machine Learning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Robust monotone submodular function maximization
• Price of dependence: stochastic submodular maximization with dependent items
• Influence maximization with partial feedback
• Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
• Deterministic Algorithms for Submodular Maximization Problems
• Adaptivity Gaps for Stochastic Probing: Submodular and XOS Functions
• Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
• Submodular Maximization with Cardinality Constraints

This page was built for publication: Adaptive robust submodular optimization and beyond