Efficient heuristic algorithms for positive-influence dominating set in social networks

Faisal N. Abu-Khzam, Karine Lamaa

Research output: Chapter in Book/Report/Conference proceedingConference Paper published in Proceedingspeer-review

Abstract

With the ongoing growth of social networks, individuals are obtaining a platform from which they can spread their opinions and ideas without restrictions and without noticing we are allowing those opinions to influence our sociological, political, and personal opinions. It is now much easier to broadcast an idea that has a potential to widely spread positive or negative influence across a social network. In an attempt to address influence in this context, the notion of a 'positive influence dominating set' appeared recently: a positive influence dominating set in a graph, or network, is a set of nodes D such that every other node has a sufficient percentage of neighbors in D. The corresponding optimization problem seeks a positive influence dominating set of minimum size. In this paper we present and study efficient heuristic algorithms for the problem and show how different types of social networks/graphs require different heuristic methods to effectively extract positive influence dominating sets.

Original languageEnglish
Title of host publicationINFOCOM 2018 - IEEE Conference on Computer Communications Workshops
PublisherIEEE, Institute of Electrical and Electronics Engineers
Pages610-615
Number of pages6
ISBN (Electronic)9781538659793
DOIs
Publication statusPublished - 6 Jul 2018
Event2018 IEEE Conference on Computer Communications Workshops, INFOCOM 2018 - Honolulu, United States
Duration: 15 Apr 201819 Apr 2018

Conference

Conference2018 IEEE Conference on Computer Communications Workshops, INFOCOM 2018
CountryUnited States
CityHonolulu
Period15/04/1819/04/18

Fingerprint

Dive into the research topics of 'Efficient heuristic algorithms for positive-influence dominating set in social networks'. Together they form a unique fingerprint.

Cite this