Approximation Algorithm for the Minimum Interval Partial Multi‐Cover Problem

ABSTRACT Given a set of points on a line, a set of intervals along the line and an integer , each point is associated with a covering requirement , the goal of the minimum interval partial multi‐cover (MinIPMC) problem is to select the minimum number of intervals to fully cover at least points, where a point is fully covered if it belongs to at least selected intervals. This paper presents a 2‐approximation algorithm for the MinIPMC problem.