A short proof for stronger version of DS decomposition in set function optimization

DOI10.1007/s10878-020-00639-4OpenAlexW3071724945MaRDI QIDQ830927

Xiang Li, H. George Du

Publication date: 10 May 2021

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00639-4

zbMATH Keywords

set functionsubmodularsupermodularDS decompositionmonotone nondecreasing

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (1)

On strict submodularity of social influence

Cites Work

• Design and analysis of approximation algorithms
• A variation of DS decomposition in set function optimization
• Set function optimization
• Monotone submodular maximization over the bounded integer lattice with cardinality constraints
• A fast double greedy algorithm for non-monotone DR-submodular function maximization

This page was built for publication: A short proof for stronger version of DS decomposition in set function optimization