• Publications
  • Influence
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
An improved coating pan apparatus and spray arm assembly are disclosed for providing facilitated maintenance and cleaning of sensitive spray nozzles. The spray arm assembly includes means for varyingExpand
  • 503
  • 81
  • PDF
Optimal approximation for the submodular welfare problem in the value oracle model
  • J. Vondrák
  • Computer Science, Mathematics
  • STOC '08
  • 17 May 2008
In the Submodular Welfare Problem, m items are to be distributed among n players with utility functions wi: 2[m] → R+. The utility functions are assumed to be monotone and submodular. Assuming thatExpand
  • 448
  • 52
  • PDF
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
Let $f:2^{N} \rightarrow \cal R^{+}$ be a non-decreasing submodular set function, and let $(N,\cal I)$ be a matroid. We consider the problem $\max_{S \in \cal I} f(S)$. It is known that the greedyExpand
  • 360
  • 44
  • PDF
Fast algorithms for maximizing submodular functions
There has been much progress recently on improved approximations for problems involving submodular objective functions, and many interesting techniques have been developed. However, the resultingExpand
  • 170
  • 44
  • PDF
Maximizing Non-monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed and undirected graphs and hypergraphs, certain constraint satisfaction problems, and maximum facilityExpand
  • 275
  • 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
  • 118
  • 34
  • PDF
Lazier Than Lazy Greedy
Is it possible to maximize a monotone submodular function faster than the widely used lazy greedy algorithm (also known as accelerated greedy), both in theory and practice? In this paper, we developExpand
  • 168
  • 31
  • PDF
Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures
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$. Our goal is to achieve {\emExpand
  • 184
  • 28
  • PDF
Maximizing Non-Monotone Submodular Functions
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum facility locationExpand
  • 225
  • 27
  • PDF
Submodular function maximization via the multilinear relaxation and contention resolution schemes
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,Expand
  • 138
  • 25
  • PDF