225 citations · 388 across the 21 of their papers we have counts for
21 papers
A New Approximation Algorithm for Minimum-Weight --Connected Dominating Set
Jiao Zhou, Yingli Ran, Panos M. Pardalos +3
Consider a graph with nonnegative node weight. A vertex subset is called a CDS (connected dominating set) if every other node has at least one neighbor in the subset and the subset…
Evolution is Still Good: Theoretical Analysis of Evolutionary Algorithms on General Cover Problems
Yaoyao Zhang, Chaojie Zhu, Shaojie Tang +3
Theoretical studies on evolutionary algorithms have developed vigorously in recent years. Many such algorithms have theoretical guarantees in both running time and approximation ra…
Composite Community-Aware Diversified Influence Maximization with Efficient Approximation
Jianxiong Guo, Qiufen Ni, Weili Wu +1
Influence Maximization (IM) is a famous topic in mobile networks and social computing, which aims at finding a small subset of users to maximize the influence spread through online…
Performance Guaranteed Evolutionary Algorithm for Minimum Connected Dominating Set
Chaojie Zhu, Yingli Ran, Zhao Zhang +1
A connected dominating set is a widely adopted model for the virtual backbone of a wireless sensor network. In this paper, we design an evolutionary algorithm for the minimum conne…
Population Monotonic Allocation Schemes for Vertex Cover Games
Han Xiao, Qizhi Fang, Ding-Zhu Du
For vertex cover games (introduced by Deng et al., Math. Oper. Res., 24:751-766, 1999), we investigate population monotonic allocation schemes (introduced by Sprumont, Games Econ.…
Beyond Uniform Reverse Sampling: A Hybrid Sampling Technique for Misinformation Prevention
Gunagmo Tong, Ding-Zhu Du
Online misinformation has been considered as one of the top global risks as it may cause serious consequences such as economic damages and public panic. The misinformation preventi…