Interactive Submodular Set Cover

An analysis of the greedy algorithm for the submodular set covering problem

L. Wolsey · 1982

Earlier work this paper cites.

Submodular Functions and Electrical Networks

H. Narayanan · 1997

Earlier work this paper cites.

A threshold of ln n for approximating set cover

U. Feige · 1998

Earlier work this paper cites.

A fast and highly quality multilevel scheme for partitioning irregular graphs

G. Karypis and V. Kumar · 1999

Earlier work this paper cites.

A theoretical analysis of query selection for collaborative filtering

S. Dasgupta, W. Lee, and P. Long · 2003

Earlier work this paper cites.

Maximizing the spread of influence through a social network

D. Kempe, J. Kleinberg, and E. Tardos · 2003

Earlier work this paper cites.

Analysis of a greedy active learning strategy

S. Dasgupta · 2004

Cited alongside, same era.

Approximating the stochastic knapsack problem: The benefit of adaptivity

B. Dean, M. Goemans, and J. Vondrak · 2004

Cited alongside, same era.

Influential nodes in a diffusion model for social networks

D. Kempe, J. Kleinberg, and E. Tardos · 2005

Cited alongside, same era.

Agnostic active learning

M. Balcan, A. Beygelzimer, and J. Langford · 2006

Cited alongside, same era.

Stochastic covering and adaptivity

M. Goemans and J. Vondrák · 2006

Cited alongside, same era.

The cost complexity of interactive learning, 2006

S. Hanneke · 2006

Cited alongside, same era.

A general dimension for query learning

J. Balcázar, J. Castro, D. Guijarro, J. Köbler, and W. Lindner · 2007

Later among the works it cites.

Stochastic submodular maximization

A. Asadpour, H. Nazerzadeh, and A. Saberi · 2008

Later among the works it cites.

Robust submodular observation selection

A. Krause, H. McMahan, C. Guestrin, and A. Gupta · 2008

Later among the works it cites.

An online algorithm for maximizing submodular functions

M. Streeter and D. Golovin · 2008

Later among the works it cites.

Adaptive submodularity: A new approach to active learning and stochastic optimization

D. Golovin and A. Krause · 2010

Closest in time.

Multi-document summarization via budgeted maximization of submodular functions

H. Lin and J. Bilmes · 2010

Closest in time.