An approximation algorithm for maximum weight budgeted connected set cover

Yingli Ran, Zhao Zhang (), Ker-I Ko and Jun Liang
Additional contact information
Yingli Ran: Xinjiang University
Zhao Zhang: Zhejiang Normal University
Ker-I Ko: National Chiao Tung University
Jun Liang: University of Texas at Dallas

Journal of Combinatorial Optimization, 2016, vol. 31, issue 4, No 11, 1505-1517

Abstract: Abstract This paper studies approximation algorithm for the maximum weight budgeted connected set cover (MWBCSC) problem. Given an element set $$X$$ X , a collection of sets $${\mathcal {S}}\subseteq 2^X$$ S ⊆ 2 X , a weight function $$w$$ w on $$X$$ X , a cost function $$c$$ c on $${\mathcal {S}}$$ S , a connected graph $$G_{\mathcal {S}}$$ G S (called communication graph) on vertex set $${\mathcal {S}}$$ S , and a budget $$L$$ L , the MWBCSC problem is to select a subcollection $${\mathcal {S'}}\subseteq {\mathcal {S}}$$ S ′ ⊆ S such that the cost $$c({\mathcal {S'}})=\sum _{S\in {\mathcal {S'}}}c(S)\le L$$ c ( S ′ ) = ∑ S ∈ S ′ c ( S ) ≤ L , the subgraph of $$G_{\mathcal {S}}$$ G S induced by $${\mathcal {S'}}$$ S ′ is connected, and the total weight of elements covered by $${\mathcal {S'}}$$ S ′ (that is $$\sum _{x\in \bigcup _{S\in {\mathcal {S'}}}S}w(x)$$ ∑ x ∈ ⋃ S ∈ S ′ S w ( x ) ) is maximized. We present a polynomial time algorithm for this problem with a natural communication graph that has performance ratio $$O((\delta +1)\log n)$$ O ( ( δ + 1 ) log n ) , where $$\delta $$ δ is the maximum degree of graph $$G_{\mathcal {S}}$$ G S and $$n$$ n is the number of sets in $${\mathcal {S}}$$ S . In particular, if every set has cost at most $$L/2$$ L / 2 , the performance ratio can be improved to $$O(\log n)$$ O ( log n ) .

Keywords: Budgeted set cover; Connected set cover; Approximation algorithm (search for similar items in EconPapers)
Date: 2016
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/s10878-015-9838-1 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:4:d:10.1007_s10878-015-9838-1

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

DOI: 10.1007/s10878-015-9838-1

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