The Budgeted Maximum Coverage Problem

@article{Khuller1999TheBM,
  title={The Budgeted Maximum Coverage Problem},
  author={Samir Khuller and Anna Moss and Joseph Naor},
  journal={Inf. Process. Lett.},
  year={1999},
  volume={70},
  pages={39-45}
}
Abstract The budgeted maximum coverage problem is: given a collection S of sets with associated costs defined over a domain of weighted elements, and a budget L , find a subset of S ′⫅ S such that the total cost of sets in S ′ does not exceed L , and the total weight of elements covered by S ′ is maximized. This problem is NP-hard. For the special case of this problem, where each set has unit cost, a (1−1/ e ) -approximation is known. Yet, prior to this work, no approximation results were known… CONTINUE READING

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 559 CITATIONS

Adaptive Maximization of Pointwise Submodular Functions With Budget Constraint

VIEW 10 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

Monotone Submodularity in Opinion Summaries

VIEW 7 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Beyond keyword search: representations and models for personalization

VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

OCCAMS -- An Optimal Combinatorial Covering Algorithm for Multi-document Summarization

VIEW 13 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

The 1-Neighbour Knapsack Problem

VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

The knapsack problem with neighbour constraints

VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

A Note on the Budgeted Maximization of Submodular Functions

VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

A Pattern-Based Approach to Recognizing Time Expressions

VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

A Service-Defined Approach for Orchestration of Heterogeneous Applications in Cloud/Edge Platforms

VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Approximation Algorithms for Submodular Maximization and Network Design Problems

VIEW 10 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2001
2020

CITATION STATISTICS

  • 112 Highly Influenced Citations

  • Averaged 49 Citations per year from 2017 through 2019