Influence maximization: a local branching algorithm for solving the positive influence dominating set problem

doi:10.1007/s10732-026-09595-4

Influence maximization: a local branching algorithm for solving the positive influence dominating set problem

2026-05-04

0

PRE

AI

DOI：10.1007/s10732-026-09595-4

Original

Original request for help

Save

Abstract

En 中文

The Positive Influence Dominating Set Problem (PIDS) is a variant of the well-known Dominating Set Problem. It involves selecting a subset of vertices that positively dominate the remaining vertices in a given graph G = (V, E). More formally, a vertex v(i) is an element of V is said to be positively dominated if at least a portion of rho deg(G)(v(i)) of its neighbors belongs to the selected set, where deg(G)(v(i)) is the degree of vi , and 0

Keywords:

Social network

Local Branching

Destructive-constructive heuristic

Dominating set

Positive influence dominating set

Influence maximization: a local branching algorithm for solving the positive influence dominating set problem

Abstract

Journal

Organization