Approximation algorithm for the partial set multi-cover problem

Yishuo Shi, Yingli Ran, Zhao Zhang (), James Willson, Guangmo Tong and Ding-Zhu Du
Additional contact information
Yishuo Shi: Xinjiang University
Yingli Ran: Zhejiang Normal University
Zhao Zhang: Zhejiang Normal University
James Willson: University of Texas at Dallas
Guangmo Tong: University of Delaware
Ding-Zhu Du: University of Texas at Dallas

Journal of Global Optimization, 2019, vol. 75, issue 4, No 10, 1133-1146

Abstract: Abstract Partial set cover problem and set multi-cover problem are two generalizations of the set cover problem. In this paper, we consider the partial set multi-cover problem which is a combination of them: given an element set E, a collection of sets $$\mathcal S\subseteq 2^E$$S⊆2E, a total covering ratio q, each set $$S\in \mathcal S$$S∈S is associated with a cost $$c_S$$cS, each element $$e\in E$$e∈E is associated with a covering requirement $$r_e$$re, the goal is to find a minimum cost sub-collection $${\mathcal {S}}'\subseteq {\mathcal {S}}$$S′⊆S to fully cover at least q|E| elements, where element e is fully covered if it belongs to at least $$r_e$$re sets of $${\mathcal {S}}'$$S′. Denote by $$r_{\max }=\max \{r_e:e\in E\}$$rmax=max{re:e∈E} the maximum covering requirement. We present an $$(O (r_{\max }\log ^2n(1+\ln (\frac{1}{\varepsilon })+\frac{1-q}{\varepsilon q})),1-\varepsilon )$$(O(rmaxlog2n(1+ln(1ε)+1-qεq)),1-ε)-bicriteria approximation algorithm, that is, the output of our algorithm has cost $$O(r_{\max }\log ^2 n(1+\ln (\frac{1}{\varepsilon })+\frac{1-q}{\varepsilon q}))$$O(rmaxlog2n(1+ln(1ε)+1-qεq)) times of the optimal value while the number of fully covered elements is at least $$(1-\varepsilon )q|E|$$(1-ε)q|E|.

Keywords: Partial set multi-cover; Minimum densest sub-collection; Approximation algorithm; Bicriteria algorithm (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10898-019-00804-y 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:jglopt:v:75:y:2019:i:4:d:10.1007_s10898-019-00804-y

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-019-00804-y

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

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