A note on maximizing a submodular set function subject to a knapsack constraint

An analysis of approximations for maximizing submodular set functions—I

George L. Nemhauser, Laurence A. Wolsey, Marshall L. Fisher · Mathematical Programming · 1978 · 4.5K citations

Natural Sciences, Computer Science, Mathematics +10

A threshold of ln <i>n</i> for approximating set cover

Uriel Feige · Journal of the ACM · 1998 · 3.1K citations · Full text

Natural Sciences, Computer Science, Mathematics +16

The budgeted maximum coverage problem

Samir Khuller, Anna Moss, Joseph Naor · Information Processing Letters · 1999 · 994 citations

Natural Sciences, Public Budgeting, Optimization +4

Approximate Algorithms for the 0/1 Knapsack Problem

Sartaj Sahni · Journal of the ACM · 1975 · 349 citations · Full text

Computing, Computer Science, Algorithms +8

An Exact Algorithm for Maximum Entropy Sampling

Chun-Wa Ko, Jon Lee, Maurice Queyranne · Operations Research · 1995 · 338 citations

Natural Sciences, Environmental Sciences, Meteorology +17