A note for approximating the submodular cover problem over integer lattice with low adaptive and query complexities

Open Webpage

Canh V. Pham, Dung K. Ha

Published: 01 Jan 2023, Last Modified: 28 Sept 2024Inf. Process. Lett. 2023EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•We study a problem named DR-Submodular Cover (DRSC), a generalization of the Set Cover problem.•We propose an efficient bicriteria algorithm for this problem.•Our algorithm significantly reduces both adaptive and query complexities than the previous algorithms.