research
∙
01/23/2023
A New Approximation Algorithm for Minimum-Weight (1,m)–Connected Dominating Set
Consider a graph with nonnegative node weight. A vertex subset is called...
share
research
∙
08/30/2022
Approximation Algorithm for Minimum p Union Under a Geometric Setting
In a minimum p union problem (MinpU), given a hypergraph G=(V,E) and an ...
research
∙
02/08/2022
A parallel algorithm for minimum weight set cover with small neighborhood property
This paper studies the minimum weight set cover (MinWSC) problem with a ...
research
∙
01/14/2022
Performance Guaranteed Evolutionary Algorithm for Minimum Connected Dominating Set
A connected dominating set is a widely adopted model for the virtual bac...
research
∙
08/10/2021
A Parallel Algorithm for Minimum Cost Submodular Cover
In a minimum cost submodular cover problem (MinSMC), given a monotone no...
research
∙
11/20/2018
