Nonsubmodular constrained profit maximization from increment perspective
From MaRDI portal
Recommendations
- Profit maximization problem with coupons in social networks
- A random algorithm for profit maximization in online social networks
- Maximizing profit of multiple adoptions in social networks with a martingale approach
- Adaptive seeding for profit maximization in social networks
- Profit maximization in social networks and non-monotone DR-submodular maximization
Cites work
- A Unified Continuous Greedy Algorithm for Submodular Maximization
- A variation of DS decomposition in set function optimization
- Automata, Languages and Programming
- Influence maximization problem: properties and algorithms
- Maximizing nonmonotone submodular functions under matroid or knapsack constraints
- Maximizing social influence in nearly optimal time
- Set function optimization
Cited in
(11)- Generalized self-profit maximization and complementary-profit maximization in attribute networks
- Diversified-profit maximization in competitive social advertising
- Generalized self-profit maximization in attribute networks
- Profit maximization problem with coupons in social networks
- A random algorithm for profit maximization in online social networks
- Competition-based generalized self-profit maximization in dual-attribute network
- Profit maximization problem with coupons in social networks
- Nonsubmodular Constrained Profit Maximization in Attribute Networks
- Competition-based generalized self-profit maximization in dual-attribute networks
- Profit maximization for multiple products in community-based social networks
- Budget-constrained profit maximization without non-negative objective assumption in social networks
This page was built for publication: Nonsubmodular constrained profit maximization from increment perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2084631)
