Novel algorithms for maximum DS decomposition

DOI10.1016/j.tcs.2020.12.041zbMath1480.90218OpenAlexW4210674605MaRDI QIDQ5919061

Shengminjie Chen, Sui-Xiang Gao, Wenguo Yang, Rong Jin

Publication date: 25 January 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.12.041

zbMATH Keywords

DS decompositionnon-submodularityparameter-conditioned greedy algorithm

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29)

Related Items (2)

Nonsubmodular Constrained Profit Maximization in Attribute Networks ⋮ A single factor approximation ratio algorithm for DR-submodular maximization on integer lattice beyond non-negativity and monotonicity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A framework of discrete DC programming by discrete convex analysis
• Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
• Influence maximization problem: properties and algorithms
• Boosting node activity by recommendations in social networks
• A variation of DS decomposition in set function optimization
• An analysis of approximations for maximizing submodular set functions—I
• Submodular Maximization with Cardinality Constraints
• A Unified Continuous Greedy Algorithm for Submodular Maximization

This page was built for publication: Novel algorithms for maximum DS decomposition