# Maximum coverage problem

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

2018

- Theory of Computing Systems
- 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)

Is this relevant?

2017

2017

- 2017

In this thesis, we investigate several heuristics to solve the maximum coverage problems and its variants. We consider maximumâ€¦Â (More)

Is this relevant?

2014

2014

- Systems and Information Engineering Designâ€¦
- 2014

The maximum coverage problem is a staple of facility location theory, and has more recently been extended to the coveringâ€¦Â (More)

Is this relevant?

Highly Cited

2013

Highly Cited

2013

- IEEE Transactions on Cybernetics
- 2013

Sensor networks have a lot of applications such as battlefield surveillance, environmental monitoring, and industrial diagnosticsâ€¦Â (More)

Is this relevant?

2011

2011

- IEEE Global Telecommunications Conferenceâ€¦
- 2011

In this paper we consider the problem of maximizing information propagation in social networks. To solve it, we introduce aâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- Inf. Process. Lett.
- 2008

We define a new problem called the Generalized Maximum Coverage Problem (GMC). GMC is an extension of the Budgeted Maximumâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- APPROX-RANDOM
- 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

- 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

- Inf. Process. Lett.
- 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

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

Is this relevant?