Approximation algorithms for the partition set cover problem with penalties

Qi Wang (), Bo Hou (), Gengsheng Zhang (), Yisheng Zhou () and Wen Liu ()
Additional contact information
Qi Wang: Hebei Normal University
Bo Hou: Hebei Normal University
Gengsheng Zhang: Hebei Normal University
Yisheng Zhou: University of Texas at Dallas
Wen Liu: Hebei Normal University

Journal of Combinatorial Optimization, 2025, vol. 49, issue 5, No 8, 15 pages

Abstract: Abstract In this paper, we consider the partition set cover problem with penalties. In this problem, we have a universe U, a partition $$\mathscr {P}=\{P_{1},\ldots ,P_{r}\}$$ P = { P 1 , … , P r } of U, and a collection $$\mathscr {S}=\{S_{1},\ldots ,S_{m}\}$$ S = { S 1 , … , S m } of nonempty subsets of U satisfying $$\bigcup _{S_i\in \mathscr {S}} S_i=U$$ ⋃ S i ∈ S S i = U . In addition, each $$P_t$$ P t $$(t\in [r])$$ ( t ∈ [ r ] ) is associated with a covering requirement $$k_t$$ k t as well as a penalty $$\pi _t$$ π t , and each $$S_i$$ S i $$(i\in [m])$$ ( i ∈ [ m ] ) is associated with a cost. A class $$P_t$$ P t attains its covering requirement by a subcollection $$\mathscr {A}$$ A of $$\mathscr {S}$$ S if at least $$k_t$$ k t elements in $$P_t$$ P t are contained in $$\bigcup _{S_i\in \mathscr {A}} S_i$$ ⋃ S i ∈ A S i . Each $$P_t$$ P t is either attaining its covering requirement or paid with its penalty. The objective is to find a subcollection $$\mathscr {A}$$ A of $$\mathscr {S}$$ S such that the sum of the cost of $$\mathscr {A}$$ A and the penalties of classes not attaining covering requirements by $$\mathscr {A}$$ A is minimized. We present two approximation algorithms for this problem. The first is based on the LP-rounding technique with approximation ratio $$K+O(\beta +\ln r)$$ K + O ( β + ln r ) , where $$K=\max _{t\in [r]}k_t$$ K = max t ∈ [ r ] k t , and $$\beta $$ β denotes the approximation guarantee for a related set cover instance obtained by rounding the standard LP. The second is based on the primal-dual method with approximation ratio lf, where $$f=\max _{e\in U}|\{S_i\in \mathscr {S}\mid e\in S_i\}|$$ f = max e ∈ U | { S i ∈ S ∣ e ∈ S i } | and $$l=\max _{t\in [r]}|P_t|$$ l = max t ∈ [ r ] | P t | .

Keywords: Approximation algorithm; Partition set cover problem; Penalty; LP-rounding; Primal-dual (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-025-01317-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:49:y:2025:i:5:d:10.1007_s10878-025-01317-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-025-01317-z

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().