Nonsubmodular constrained profit maximization from increment perspective
type: Item
instance of: scholarly article
title: Nonsubmodular constrained profit maximization from increment perspective
zbMATH Open document ID: 1504.90118
author: Liman Du
author: Shengminjie Chen
author: Suixiang Gao
author: Wenguo Yang
published in: Journal of Combinatorial Optimization
publication date: 2022-10-18T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 7603284
zbMATH Keywords: profit maximization
zbMATH Keywords: nonsubmodularity
zbMATH Keywords: social network
describes a project that uses: SIMPATH
MaRDI profile type: MaRDI publication profile
full work available at URL: s10878-021-00774-6
OpenAlex ID: W4253724943
cites work: Maximizing social influence in nearly optimal time
cites work: A Unified Continuous Greedy Algorithm for Submodular Maximization
cites work: Automata, Languages and Programming
cites work: Maximizing nonmonotone submodular functions under matroid or knapsack constraints
cites work: A variation of DS decomposition in set function optimization
cites work: Set function optimization
cites work: Influence maximization problem: properties and algorithms
DOI: 10.1007/S10878-021-00774-6
Recommended article: Profit maximization problem with coupons in social networks
Recommended article: A random algorithm for profit maximization in online social networks
Recommended article: Maximizing profit of multiple adoptions in social networks with a martingale approach
Recommended article: Adaptive seeding for profit maximization in social networks
Recommended article: Profit maximization in social networks and non-monotone DR-submodular maximization
description: scientific article; zbMATH DE number 7603284