• Publications
  • Influence
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
TLDR
An improved coating pan apparatus and spray arm assembly are disclosed for providing facilitated maintenance and cleaning of sensitive spray nozzles. Expand
  • 522
  • 83
  • PDF
Optimal approximation for the submodular welfare problem in the value oracle model
  • J. Vondrák
  • Mathematics, Computer Science
  • STOC '08
  • 17 May 2008
TLDR
We develop a randomized continuous greedy algorithm which achieves a (1-1/e)-approximation for the Submodular Welfare Problem in the value oracle model where the only access to the utility functions is through a black box returning wi(S) for a given set S. Expand
  • 457
  • 52
  • PDF
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
TLDR
We show that the generalized assignment problem (GAP) is a special case of our problem; although the reduction requires |N| to be exponential in the original problem size, we obtain a (1 i¾? 1/e)-approximation for variants of GAP with more complex constraints. Expand
  • 366
  • 45
  • PDF
Fast algorithms for maximizing submodular functions
TLDR
In this paper we develop algorithms that match the best known approximation guarantees, but with significantly improved running times, for maximizing a monotone submodular function subject to various constraints. Expand
  • 178
  • 45
  • PDF
Maximizing Non-monotone Submodular Functions
TLDR
In this paper, we design the first constant-factor approximation algorithms for maximizing nonnegative (non-monotone) submodular functions. Expand
  • 277
  • 36
Submodular maximization by simulated annealing
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for the unconstrainedExpand
  • 121
  • 34
  • PDF
Lazier Than Lazy Greedy
TLDR
We develop the first linear-time algorithm for maximizing a general monotone submodular function subject to a cardinality constraint. Expand
  • 177
  • 33
  • PDF
Maximizing Non-Monotone Submodular Functions
TLDR
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs, certain constraint satisfaction problems and maximum facility location problems. Expand
  • 229
  • 28
  • PDF
Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures
TLDR
We consider the problem of randomly rounding a fractional solution $x$ in an integer polytope $P \subseteq [0,1]^n$ to a vertex $X$ of $P$, so that $\E[X] = x$. Expand
  • 188
  • 28
  • PDF
Submodular function maximization via the multilinear relaxation and contention resolution schemes
TLDR
We consider the problem of maximizing a non-negative submodular set function f:2N -> RR+ over a ground set N subject to a variety of packing type constraints including (multiple) matroid constraints, knapsack constraints, and their intersections. Expand
  • 147
  • 26
  • PDF