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 $K$ Components (URPCF${}_K$) problem. URPCF${}_K$ aims to find a f…