Computational Aspects of Optimal Strategic Network Diffusion

09/10/2018
by   Marcin Waniek, et al.
0

The diffusion of information has been widely modeled as stochastic diffusion processes on networks. Alshamsi et al. (2018) proposed a model of strategic diffusion in networks of related activities. In this work we investigate the computational aspects of finding the optimal strategy of strategic diffusion. We prove that finding an optimal solution to the problem is NP-complete in a general case. To overcome this computational difficulty, we present an algorithm to compute an optimal solution based on a dynamic programming technique. We also show that the problem is fixed parameter-tractable when parametrized by the product of the treewidth and maximum degree. We analyze the possibility of developing an efficient approximation algorithm and show that two heuristic algorithms proposed so far cannot have better than a logarithmic approximation guarantee. Finally, we prove that the problem does not admit better than a logarithmic approximation, unless P=NP.

READ FULL TEXT
research
03/14/2019

Covert Networks: How Hard is It to Hide?

Covert networks are social networks that often consist of harmful users....
research
06/08/2023

An Improved Algorithm for Finding Maximum Outerplanar Subgraphs

We study the NP-complete Maximum Outerplanar Subgraph problem. The previ...
research
08/31/2022

A heuristic algorithm for the maximum happy vertices problem using tree decompositions

We propose a new heuristic algorithm for the Maximum Happy Vertices prob...
research
10/06/2021

Parameterized Algorithms for the Steiner Tree Problem on a Directed Hypercube

We address the problem of computing a Steiner Arborescence on a directed...
research
01/24/2017

On Robustness in Multilayer Interdependent Network

Critical Infrastructures like power and communication networks are highl...
research
08/05/2021

Bifactor Approximation for Location Routing with Vehicle and Facility Capacities

Location Routing is a fundamental planning problem in logistics, in whic...
research
02/13/2021

Diffusion Approximations for a Class of Sequential Testing Problems

We consider a decision maker who must choose an action in order to maxim...

Please sign up or login with your details

Forgot password? Click here to reset