On the approximability of positive influence dominating set in social networks
type: Item
instance of: scholarly article
title: On the approximability of positive influence dominating set in social networks
zbMATH Open document ID: 1322.90105
author: Thang N. Dinh
author: Yilin Shen
author: My T. Thai
author: Dung T. Nguyen
published in: Journal of Combinatorial Optimization
publication date: 2014-06-24T00:00:00Z
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 91D30
zbMATH DE Number: 6307068
zbMATH Keywords: hardness of approximation
zbMATH Keywords: approximation algorithm
zbMATH Keywords: social networks
zbMATH Keywords: information diffusion
MaRDI profile type: Publication
full work available at URL: s10878-012-9530-7
OpenAlex ID: W2069808479
cites work: A random graph model for massive graphs
cites work: Algorithms – ESA 2004
cites work: Hardness, Approximability, and Exact Algorithms for Vector Domination and Total Vector Domination in Graphs
cites work: A threshold of ln n for approximating set cover
cites work: On the hardness of optimization in power-law graphs
cites work: Community structure in social and biological networks
cites work: Automata, Languages and Programming
cites work: Non-approximability results for optimization problems on bounded degree instances
cites work: Positive Influence Dominating Set in Online Social Networks
cites work: Polynomial time approximation scheme for \(t\)-latency bounded information propagation problem in wireless networks
cites work: New dominating sets in social networks
DOI: 10.1007/S10878-012-9530-7
Recommended article: On positive influence dominating sets in social networks
Recommended article: A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks
Recommended article: Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem
Recommended article: Approximation algorithm for partial positive influence problem in social network
Recommended article: On the Approximability of Influence in Social Networks
Recommended article: Q3194249
Recommended article: Parameterized approximability of maximizing the spread of influence in networks
Recommended article: Parameterized Approximability of Maximizing the Spread of Influence in Networks
Recommended article: Better approximation algorithms for influence maximization in online social networks
Recommended article: Positive influence domination in graphs
description: scientific article; zbMATH DE number 6307068