Data-dependent approximation in social computing

DOI10.1007/978-3-030-12767-1_3MaRDI QIDQ2337588zbMATH OpenOpenAlexFDO

Authors Weili Wu, Yi Li, Panos M. Pardalos, Du Ding-Zhu

Publication date 20 November 2019

Full work available at URL https://doi.org/10.1007/978-3-030-12767-1_3

zbMATH Keywords

data-dependent approximationnonsubmodular combinatorial optimizationsocial computing

Mathematics Subject Classification ID

Approximations and expansions (41A99) Combinatorial optimization (90C27) Social networks; opinion dynamics (91D30)

Recommendations

• Influence maximization problem: properties and algorithms
• Nonlinear combinatorial optimization
• Non-submodular maximization on massive data streams
• Minimum non-submodular cover problem with applications
• A survey on streaming algorithms for maximizing submodular functions

Cited in

(1)

• Constructing optimized quotient space chain based on submodular function

This page was built for publication: Data-dependent approximation in social computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2337588)