Maximum coverage problem with group budget constraints

Boaz Farbstein () and Asaf Levin ()
Additional contact information
Boaz Farbstein: The Technion
Asaf Levin: The Technion

Journal of Combinatorial Optimization, 2017, vol. 34, issue 3, No 5, 725-735

Abstract: Abstract We study the maximum coverage problem with group budget constraints (MCG). The input consists of a ground set X, a collection $$\psi $$ ψ of subsets of X each of which is associated with a combinatorial structure such that for every set $$S_j\in \psi $$ S j ∈ ψ , a cost $$c(S_j)$$ c ( S j ) can be calculated based on the combinatorial structure associated with $$S_j$$ S j , a partition $$G_1,G_2,\ldots ,G_l$$ G 1 , G 2 , … , G l of $$\psi $$ ψ , and budgets $$B_1,B_2,\ldots ,B_l$$ B 1 , B 2 , … , B l , and B. A solution to the problem consists of a subset H of $$\psi $$ ψ such that $$\sum _{S_j\in H} c(S_j) \le B$$ ∑ S j ∈ H c ( S j ) ≤ B and for each $$i \in {1,2,\ldots ,l}$$ i ∈ 1 , 2 , … , l , $$\sum _{S_j \in H\cap G_i}c(S_j)\le B_i$$ ∑ S j ∈ H ∩ G i c ( S j ) ≤ B i . The objective is to maximize $$|\bigcup _{S_j\in H}S_j|$$ | ⋃ S j ∈ H S j | . In our work we use a new and improved analysis of the greedy algorithm to prove that it is a $$(\frac{\alpha }{3+2\alpha })$$ ( α 3 + 2 α ) -approximation algorithm, where $$\alpha $$ α is the approximation ratio of a given oracle which takes as an input a subset $$X^{new}\subseteq X$$ X n e w ⊆ X and a group $$G_i$$ G i and returns a set $$S_j\in G_i$$ S j ∈ G i which approximates the optimal solution for $$\max _{D\in G_i}\frac{|D\cap X^{new}|}{c(D)}$$ max D ∈ G i | D ∩ X n e w | c ( D ) . This analysis that is shown here to be tight for the greedy algorithm, improves by a factor larger than 2 the analysis of the best known approximation algorithm for MCG.

Keywords: Maximum coverage; Greedy algorithm; Approximation algorithms (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-016-0102-0 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-016-0102-0

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

DOI: 10.1007/s10878-016-0102-0

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