A refined analysis of submodular Greedy
نویسندگان
چکیده
Abstract Many algorithms for maximizing a monotone submodular function subject to knapsack constraint rely on the natural greedy heuristic. We present novel refined analysis of this heuristic which enables us to: (1) reduce enumeration in tight ( 1 ? e ) -approximation [Sviridenko 04] from subsets size three two; (2) an improved upper bound 0.42945 classic algorithm returns better between single element and output
منابع مشابه
Greedy Maximization of Submodular Functions
Traditional optimization techniques often rely upon functions that are convex or at least locally convex. Such diverse methods as gradient descent, loopy belief propagation, and linear programming all rely upon convex functions. However, many natural functions are not convex, yet optimizing over them is both possible and necessary. The class of submodular functions is particularly well-behaved ...
متن کاملParallel Double Greedy Submodular Maximization
Many machine learning problems can be reduced to the maximization of submodular functions. Although well understood in the serial setting, the parallel maximization of submodular functions remains an open area of research with recent results [1] only addressing monotone functions. The optimal algorithm for maximizing the more general class of non-monotone submodular functions was introduced by ...
متن کاملGreedy approximations for minimum submodular cover with submodular cost
It is well-known that a greedy approximation with an integer-valued polymatroid potential function f is H(γ )-approximation of the minimum submodular cover problem with linear cost where γ is the maximum value of f over all singletons and H(γ ) is the γ -th harmonic number. In this paper, we establish similar results for the minimum submodular cover problem with a submodular cost (possibly nonl...
متن کاملOnline Submodular Welfare Maximization: Greedy is Optimal
We prove that no online algorithm (even randomized, against an oblivious adversary) is better than 1/2competitive for welfare maximization with coverage valuations, unless NP = RP . Since the Greedy algorithm is known to be 1/2-competitive for monotone submodular valuations, of which coverage is a special case, this proves that Greedy provides the optimal competitive ratio. On the other hand, w...
متن کاملNotes on Greedy Algorithms for Submodular Maximization
All the functions we consider are set functions defined over subsets of a ground set N . Definition 1. A function f : 2 → R is monotone iff: ∀S ⊆ T ⊆ N, f(S) ≤ f(T ) Definition 2. For f : 2 → R and S ⊆ N , the marginal contribution to S is the function fS defined by: ∀T ⊆ N, fS(T ) = f(S ∪ T )− f(S) When there is no ambiguity, we write fS(e) instead of fS({e}) for e ∈ N , S + e instead of S ∪ {...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2021
ISSN: ['0167-6377', '1872-7468']
DOI: https://doi.org/10.1016/j.orl.2021.04.006