Maximum coverage problem

The maximum coverage problem is a classical question in computer science, computational complexity theory, and operations research.It is a problem… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We study the classic NP-Hard problem of finding the maximum k-set coverage in the data stream model: given a set system of m sets… (More)
  • figure 1
Is this relevant?
2017
2017
  • Ymro Nils Hoogendoorn
  • 2017
In this thesis, we investigate several heuristics to solve the maximum coverage problems and its variants. We consider maximum… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2014
2014
The maximum coverage problem is a staple of facility location theory, and has more recently been extended to the covering… (More)
  • table I
  • table II
  • table III
  • table V
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Sensor networks have a lot of applications such as battlefield surveillance, environmental monitoring, and industrial diagnostics… (More)
  • figure 3
  • figure 4
  • figure 5
  • table IV
  • table V
Is this relevant?
2011
2011
In this paper we consider the problem of maximizing information propagation in social networks. To solve it, we introduce a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We define a new problem called the Generalized Maximum Coverage Problem (GMC). GMC is an extension of the Budgeted Maximum… (More)
  • figure 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
  • NIMROD MEGIDD, EITAN ZEMELS, S. LOUIS HAKIMIB
  • 2004
In this paper we define and discuss the following problem which we call the maximum coverage location problem. A transportation… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
The budgeted maximum coverage problem is: given a collection S of sets with associated costs deened over a domain of weighted… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
In this paper, we consider a general covering problem in which k subsets are to be selected such that their union covers as large… (More)
  • figure 1
Is this relevant?