40 citations · 97 across the 16 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.DS2023
Approximation Algorithm for Unrooted Prize-Collecting Forest with Multiple Components and Its Application on Prize-Collecting Sweep Coverage
Wei Liang, Shaojie Tang, Zhao Zhang
In this paper, we introduce a polynomial-time 2-approximation algorithm for the Unrooted Prize-Collecting Forest with Components (URPCF) problem. URPCF aims to find a f…
cs.DS2023
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…