This paper studies the fair influence maximization problem with efficient algorithms. In particular, given a graph G, a community structure C consisting of disjoint communities, and a budget k, the ...

Abstract: Graph-structured combinatorial problems in complex networks are prevalent in many domains, and are computationally demanding due to their complexity and non-linear nature. Traditional ...

Abstract: Simultaneously transmitting and reflecting reconfigurable intelligent surface (STAR-RIS) has received substantial attentions due to its capability of constructing the intelligent wireless ...