Approximation algorithms for minimum weight partial connected set cover problem

Dongyue Liang, Zhao Zhang, Xianliang Liu, Wei Wang () and Yaolin Jiang
Additional contact information
Dongyue Liang: Xi’an Jiaotong University
Zhao Zhang: Zhejiang Normal University
Xianliang Liu: Xi’an Jiaotong University
Wei Wang: Xi’an Jiaotong University
Yaolin Jiang: Xi’an Jiaotong University

Journal of Combinatorial Optimization, 2016, vol. 31, issue 2, No 14, 696-712

Abstract: Abstract In the Minimum Weight Partial Connected Set Cover problem, we are given a finite ground set $$U$$ U , an integer $$q\le |U|$$ q ≤ | U | , a collection $$\mathcal {E}$$ E of subsets of $$U$$ U , and a connected graph $$G_{\mathcal {E}}$$ G E on vertex set $$\mathcal {E}$$ E , the goal is to find a minimum weight subcollection of $$\mathcal {E}$$ E which covers at least $$q$$ q elements of $$U$$ U and induces a connected subgraph in $$G_{\mathcal {E}}$$ G E . In this paper, we derive a “partial cover property” for the greedy solution of the Minimum Weight Set Cover problem, based on which we present (a) for the weighted version under the assumption that any pair of sets in $$\mathcal {E}$$ E with nonempty intersection are adjacent in $$G_{\mathcal {E}}$$ G E (the Minimum Weight Partial Connected Vertex Cover problem falls into this range), an approximation algorithm with performance ratio $$\rho (1+H(\gamma ))+o(1)$$ ρ ( 1 + H ( γ ) ) + o ( 1 ) , and (b) for the cardinality version under the assumption that any pair of sets in $$\mathcal {E}$$ E with nonempty intersection are at most $$d$$ d -hops away from each other (the Minimum Partial Connected $$k$$ k -Hop Dominating Set problem falls into this range), an approximation algorithm with performance ratio $$2(1+dH(\gamma ))+o(1)$$ 2 ( 1 + d H ( γ ) ) + o ( 1 ) , where $$\gamma =\max \{|X|:X\in \mathcal {E}\}$$ γ = max { | X | : X ∈ E } , $$H(\cdot )$$ H ( · ) is the Harmonic number, and $$\rho $$ ρ is the performance ratio for the Minimum Quota Node-Weighted Steiner Tree problem.

Keywords: Set cover; Greedy algorithm; Approximation algorithm; Submodular function (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-014-9782-5 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:31:y:2016:i:2:d:10.1007_s10878-014-9782-5

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

DOI: 10.1007/s10878-014-9782-5

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 ().