Approximating Robust Parameterized Submodular Function Maximization in Large-Scales

DOI10.1142/S0217595919500222zbMath1423.90144MaRDI QIDQ5193220

Dongmei Zhang, Yishui Wang, Yanjun Jiang, Ruiqi Yang, Da-Chuan Xu

Publication date: 9 September 2019

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

robuststreamapproximation algorithmsubmodular function

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Sensitivity, stability, parametric optimization (90C31) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

Maximization of monotone non-submodular functions with a knapsack constraint over the integer lattice ⋮ Approximation Algorithms for Spherical k-Means Problem with Penalties Using Local Search Techniques ⋮ Sequence submodular maximization meets streaming ⋮ Randomized Parallel Algorithm for Maximizing Nonsubmodular Function Subject to Cardinality Constraint

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Submodular maximization meets streaming: matchings, matroids, and more
• Restricted strong convexity implies weak submodularity
• Robust Monotone Submodular Function Maximization
• Streaming Algorithms for Submodular Function Maximization
• An analysis of approximations for maximizing submodular set functions—I
• Online Submodular Maximization with Preemption

This page was built for publication: Approximating Robust Parameterized Submodular Function Maximization in Large-Scales