activity
20152022
most citedOn Approximating Partial Set Cover and Generalizations

6 citations · 6 across the 7 of their papers we have counts for

collaborators

8 papers

cs.NE2022

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…

cs.DS2022

A parallel algorithm for minimum weight set cover with small neighborhood property

Yingli Ran, Yaoyao Zhang, Zhao Zhang

This paper studies the minimum weight set cover (MinWSC) problem with a {\em small neighborhood cover} (SNC) property proposed by Agarwal {\it et al.} in \cite{Agarwal.}. A paralle…

cs.DM2022

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…

cs.DS20196 cited

On Approximating Partial Set Cover and Generalizations

Chandra Chekuri, Kent Quanrud, Zhao Zhang

Partial Set Cover (PSC) is a generalization of the well-studied Set Cover problem (SC). In PSC the input consists of an integer and a set system where is a finite s…

cs.DM2019

Extremality and Sharp Bounds for the -edge-connectivity of Graphs

Yuefang Sun, Xiaoyan Zhang, Zhao Zhang

Boesch and Chen (SIAM J. Appl. Math., 1978) introduced the cut-version of the generalized edge-connectivity, named -edge-connectivity. For any integer with ,…

cs.DM2018

Approximation Algorithm for the Partial Set Multi-Cover Problem

Yishuo Shi, Yingli Ran, Zhao Zhang +3

Partial set cover problem and set multi-cover problem are two generalizations of set cover problem. In this paper, we consider the partial set multi-cover problem which is a combin…