Improved algorithms for non-submodular function maximization problem

DOI10.1007/978-3-030-93176-6_17zbMath1503.90117OpenAlexW4206032745MaRDI QIDQ5918732

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

Publication date: 1 July 2022

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

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

zbMATH Keywords

uniform matroidstreaming modelnon-submodular maximization

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)

Cites Work

• Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
• Parametric monotone function maximization with matroid constraints
• Non-submodular maximization on massive data streams
• Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature

This page was built for publication: Improved algorithms for non-submodular function maximization problem