Pages that link to "Item:Q5384031"

The following pages link to Maximizing Social Influence in Nearly Optimal Time (Q5384031):

Displaying 50 items.

• New trends in influence maximization models (Q826341) (← links)
• Influence maximization problem: properties and algorithms (Q830929) (← links)
• Profit maximization for competitive social advertising (Q831129) (← links)
• Minimizing the expected complete influence time of a social network (Q985076) (← links)
• Targeted influential nodes selection in location-aware social networks (Q1723006) (← links)
• A two-stage stochastic programming approach for influence maximization in social networks (Q1744898) (← links)
• Rumor correction maximization problem in social networks (Q1998850) (← links)
• TIFIM: a two-stage iterative framework for influence maximization in social networks (Q2011109) (← links)
• Robust budget allocation via continuous submodular functions (Q2019911) (← links)
• Boosting node activity by recommendations in social networks (Q2023132) (← links)
• Attribute based diversification of seeds for targeted influence maximization (Q2055595) (← links)
• On the influence maximization problem and the percolation phase transition (Q2068505) (← links)
• Adaptive influence maximization under fixed observation time-step (Q2079873) (← links)
• Nonsubmodular constrained profit maximization from increment perspective (Q2084631) (← links)
• Kernel-based models for influence maximization on graphs based on Gaussian process variance minimization (Q2112685) (← links)
• Minimum budget for misinformation detection in online social networks with provable guarantees (Q2115311) (← links)
• Union acceptable profit maximization in social networks (Q2143149) (← links)
• Maximize the probability of union-influenced in social networks (Q2149879) (← links)
• Fixed observation time-step: adaptive influence maximization (Q2151373) (← links)
• Maximizing \(k\)-submodular functions under budget constraint: applications and streaming algorithms (Q2168767) (← links)
• A graph-theoretical basis of stochastic-cascading network influence: characterizations of influence-based centrality (Q2182332) (← links)
• A neighbour scale fixed approach for influence maximization in social networks (Q2218509) (← links)
• Matching influence maximization in social networks (Q2220781) (← links)
• An efficient linear programming based method for the influence maximization problem in social networks (Q2224940) (← links)
• Finding top-\(k\) influential users in social networks under the structural diversity model (Q2279536) (← links)
• Viral marketing of online game by DS decomposition in social networks (Q2282998) (← links)
• Profit maximization problem with coupons in social networks (Q2282999) (← links)
• A random algorithm for profit maximization in online social networks (Q2283001) (← links)
• General rumor blocking: an efficient random algorithm with martingale approach (Q2283009) (← links)
• Whom to befriend to influence people (Q2292915) (← links)
• Semantics-aware influence maximization in social networks (Q2660745) (← links)
• Exact stochastic constraint optimisation with applications in network analysis (Q2667834) (← links)
• Influence analysis: A survey of the state-of-the-art (Q2668539) (← links)
• Higher order monotonicity and submodularity of influence in social networks: from local to global (Q2672246) (← links)
• Transmission errors and influence maximization in the voter model (Q5006931) (← links)
• Edge Deletion Algorithms for Minimizing Spread in SIR Epidemic Models (Q5073507) (← links)
• Fairness in Influence Maximization through Randomization (Q5076357) (← links)
• Influence Maximization with Latency Requirements on Social Networks (Q5085986) (← links)
• Seeding with Costly Network Information (Q5106371) (← links)
• The temporal aspects of the evidence-based influence maximization on social networks (Q5268924) (← links)
• Time bounded adaptive information coverage in social networks (Q5858179) (← links)
• The Complexity of Partial Function Extension for Coverage Functions (Q5875484) (← links)
• Submodular Maximization Subject to a Knapsack Constraint Under Noise Models (Q5888385) (← links)
• The Limitations of Optimization from Samples (Q5889795) (← links)
• Two-stage pricing strategy with price discount in online social networks (Q5918361) (← links)
• How to choose friends strategically (Q5919425) (← links)
• Improved approximation algorithms for \(k\)-submodular maximization under a knapsack constraint (Q6065659) (← links)
• Uncertainty in Study of Social Networks: Robust Optimization and Machine Learning (Q6077937) (← links)
• Online conflict resolution: algorithm design and analysis (Q6084129) (← links)
• Opinion influence maximization problem in online social networks based on group polarization effect (Q6122193) (← links)