Multi-set function maximization with application in viral marketing
From MaRDI portal
Cites work
- \textsc{Greedy+Max}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization
- A note on maximizing a submodular set function subject to a knapsack constraint
- A random algorithm for profit maximization in online social networks
- Adaptive influence maximization: adaptability via nonadaptability
- An analysis of approximations for maximizing submodular set functions—I
- An Optimal Algorithm for Monte Carlo Estimation
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Cost-Effective Social Media Influencer Marketing
- Evolutionary learning: advances in theories and algorithms
- Guarantees for maximization of \(k\)-submodular functions with a knapsack and a matroid constraint
- scientific article; zbMATH DE number 5888315 (Why is no real title available?)
- Improved approximation algorithms for \(k\)-submodular function maximization
- Improved randomized algorithm for k-submodular function maximization
- Information coverage maximization for multiple products in social networks
- Least-cost influence maximization on social networks
- Maximizing k-submodular functions and beyond
- Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms
- Maximizing a monotone submodular function subject to a matroid constraint
- Maximizing Non-monotone Submodular Functions
- Maximizing social influence in nearly optimal time
- Monotone \(k\)-submodular knapsack maximization: an analysis of the Greedy+Singleton algorithm
- Monotone k-submodular secretary problems: cardinality and knapsack constraints
- Near-optimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies
- Nonmonotone submodular maximization via a structural continuous greedy algorithm (extended abstract)
- On maximizing a monotone \(k\)-submodular function subject to a matroid constraint
- Optimal approximation for submodular and supermodular optimization with bounded curvature
- Submodular functions and optimization.
- Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem
- The complexity of soft constraint satisfaction
- Towards minimizing k-submodular functions
- Viral Marketing for Complementary Products
- Weakly Submodular Function Maximization Using Local Submodularity Ratio.
This page was built for publication: Multi-set function maximization with application in viral marketing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7406190)
