An improved coating pan apparatus and spray arm assembly are disclosed for providing facilitated maintenance and cleaning of sensitive spray nozzles.Expand

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

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

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

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 unconstrained… Expand

Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs, certain constraint satisfaction problems and maximum facility location problems.Expand

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

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