Budget-constrained profit maximization without non-negative objective assumption in social networks
From MaRDI portal
Publication:6635815
DOI10.1007/s10898-024-01406-zMaRDI QIDQ6635815
Ding-Zhu Du, Suning Gong, Qingqin Nong, Yue Wang
Publication date: 12 November 2024
Published in: Journal of Global Optimization (Search for Journal in Brave)
Cites Work
- Approximation for the minimum cost doubly resolving set problem
- A note on maximizing a submodular set function subject to a knapsack constraint
- Ranking with submodular functions on a budget
- Profit maximization problem with coupons in social networks
- A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem
- A fast and deterministic algorithm for knapsack-constrained monotone DR-submodular maximization over an integer lattice
- Profit maximization in social networks and non-monotone DR-submodular maximization
- Practical budgeted submodular maximization
- Maximizing Non-monotone Submodular Functions
- An analysis of approximations for maximizing submodular set functions—I
- Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
- A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint
- Constrained Submodular Maximization via a Nonsymmetric Technique
- Maximizing Social Influence in Nearly Optimal Time
- Guess free maximization of submodular and linear sums
- Improved deterministic algorithms for non-monotone submodular maximization
This page was built for publication: Budget-constrained profit maximization without non-negative objective assumption in social networks
