Stochastic-lazier-greedy algorithm for monotone non-submodular maximization

DOI10.3934/jimo.2020085zbMath1476.90283OpenAlexW3022282594MaRDI QIDQ2666680

Lu Han, Dongmei Zhang, Min Li, Da-Chuan Xu

Publication date: 23 November 2021

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2020085

zbMATH Keywords

monotonegreedy algorithmcardinality constraintnon-submodularset function maximization

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• A threshold of ln n for approximating set cover
• An analysis of approximations for maximizing submodular set functions—I
• Best Algorithms for Approximating the Maximum of a Submodular Set Function
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Stochastic-lazier-greedy algorithm for monotone non-submodular maximization