A simple approximation algorithm for minimum weight partial connected set cover

Yubai Zhang, Yingli Ran and Zhao Zhang ()
Additional contact information
Yubai Zhang: Zhejiang Normal University
Yingli Ran: Xinjiang University
Zhao Zhang: Zhejiang Normal University

Journal of Combinatorial Optimization, 2017, vol. 34, issue 3, No 19, 956-963

Abstract: Abstract This paper studies the minimum weight partial connected set cover problem (PCSC). Given an element set U, a collection $${\mathcal {S}}$$ S of subsets of U, a weight function c : $${\mathcal {S}} \rightarrow {\mathbb {Q}}^{+}$$ S → Q + , a connected graph $$G_{{\mathcal {S}}}$$ G S on vertex set $${\mathcal {S}}$$ S , and a positive integer $$k\le |U|$$ k ≤ | U | , the goal is to find a minimum weight subcollection $${\mathcal {S}}' \subseteq {\mathcal {S}}$$ S ′ ⊆ S such that the subgraph of G induced by $${\mathcal {S}}'$$ S ′ is connected, $$|\bigcup _{S\in {\mathcal {S}}^{\prime }}S| \ge k$$ | ⋃ S ∈ S ′ S | ≥ k , and the weight of $${\mathcal {S}}'$$ S ′ is minimum. If the graph $$G_{{\mathcal {S}}}$$ G S has the property that any two sets with a common element has hop distance at most r in $$G_{{\mathcal {S}}}$$ G S , then the problem is called r-hop PCSC. We presented an $$O(\ln (m+n))$$ O ( ln ( m + n ) ) -approximation algorithm for the minimum weight 1-hop PCSC problem and an $$O(\ln (m+n))$$ O ( ln ( m + n ) ) -approximation algorithm for the minimum cardinality r-hop PCSC problem. Our performance ratio improves previous results and our method is much simpler than previous methods.

Keywords: Partial connected set cover; Budgeted connected set cover; Approximation algorithm (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-017-0122-4 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:34:y:2017:i:3:d:10.1007_s10878-017-0122-4

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

DOI: 10.1007/s10878-017-0122-4

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