# Approximating submodular functions everywhere

@inproceedings{Goemans2009ApproximatingSF, title={Approximating submodular functions everywhere}, author={Michel X. Goemans and Nicholas J. A. Harvey and Satoru Iwata and Vahab S. Mirrokni}, booktitle={SODA}, year={2009} }

Submodular functions are a key concept in combinatorial optimization. Algorithms that involve submodular functions usually assume that they are given by a (value) oracle. Many interesting problems involving submodular functions can be solved using only polynomially many queries to the oracle, e.g., exact minimization or approximate maximization.
In this paper, we consider the problem of approximating a non-negative, monotone, submodular function f on a ground set of size n everywhere, after…

## Figures from this paper

## 159 Citations

On the Approximation of Submodular Functions

- Mathematics, Computer ScienceArXiv
- 2013

A large number of prior works imply that monotone submodular functions can be approximated by coverage functions with a factor between $O(\sqrt{n} \log n)$ and $\Omega(n^{1/3} /\log^2 n) $ and this work proves both upper and lower bounds on such approximations.

A pr 2 01 3 On the Approximation of Submodular Functions

- Mathematics, Computer Science
- 2013

This work considers the question of how well can one class of submodular functions be approximated by another (simpler)class of sub modular functions, and proves both upper and lower bounds on such approximations.

Submodular Functions: Optimization and Approximation

- Computer Science, Mathematics
- 2011

An efficient method has been developed for approximating submoduar functions everywhere, which leads to a generic framework of designing approximation algorithms for combinatorial optimization problems with submodular costs.

Submodular Optimization under Noise

- Computer Science, MathematicsCOLT
- 2017

This work focuses on the question of maximizing a monotone submodular function under a cardinality constraint when given access to a noisy oracle of the function, and shows that no randomized algorithm can obtain an approximation ratio better than 1/2+o(1) and no non-trivial approximation guarantee can be obtained.

Submodular Approximation: Sampling-based Algorithms and Lower Bounds

- Computer Science, Mathematics2008 49th Annual IEEE Symposium on Foundations of Computer Science
- 2008

This work introduces several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions, and presents an algorithm for approximately learning sub modular functions with special structure, whose guarantee is close to the lower bound.

Communication Complexity of Combinatorial Auctions with Submodular Valuations

- Mathematics, Computer ScienceSODA
- 2013

It is shown that a (1−1/2e+e)-approximation for welfare maximization in combinatorial auctions with submodular valuations would require exponential communication, the first communication complexity lower bound for constant-factor approximation of the sub modular welfare problem.

Is Submodularity Testable?

- MathematicsAlgorithmica
- 2012

This work begins the study of property testing of submodularity on the boolean hypercube, and analyzes a natural tester for this problem, and proves an interesting lower bound suggesting that this tester cannot be efficient in terms of ϵ.

Learning submodular functions

- Mathematics, Computer ScienceSTOC '11
- 2011

This paper considers PAC-style learning of submodular functions in a distributional setting and uses lossless expanders to construct a new family of matroids which can take wildly varying rank values on superpolynomially many sets; no such construction was previously known.

Approximate F2-Sketching of Valuation Functions

- Computer Science, MathematicsAPPROX-RANDOM
- 2019

Both upper and lower bounds on dimension obtained in this work extend to the space complexity of algorithms evaluating f(x) under long sequences of additive updates to the input x presented as a stream.

## References

SHOWING 1-10 OF 47 REFERENCES

A simple combinatorial algorithm for submodular function minimization

- Computer Science, MathematicsSODA
- 2009

This is the first fully combinatorial submodular function minimization algorithm that does not rely on the scaling method and can be implemented in strongly polynomial time using only additions, subtractions, comparisons, and the oracle calls for function evaluation.

Submodular Approximation: Sampling-based Algorithms and Lower Bounds

- Computer Science, Mathematics2008 49th Annual IEEE Symposium on Foundations of Computer Science
- 2008

This work introduces several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions, and presents an algorithm for approximately learning sub modular functions with special structure, whose guarantee is close to the lower bound.

An analysis of approximations for maximizing submodular set functions—I

- MathematicsMath. Program.
- 1978

It is shown that a “greedy” heuristic always produces a solution whose value is at least 1 −[(K − 1/K]K times the optimal value, which can be achieved for eachK and has a limiting value of (e − 1)/e, where e is the base of the natural logarithm.

Learning submodular functions

- Mathematics, Computer ScienceSTOC '11
- 2011

This paper considers PAC-style learning of submodular functions in a distributional setting and uses lossless expanders to construct a new family of matroids which can take wildly varying rank values on superpolynomially many sets; no such construction was previously known.

Optimal approximation for the submodular welfare problem in the value oracle model

- MathematicsSTOC
- 2008

A randomized continuous greedy algorithm is developed which achieves a (1-1/e)-approximation for the Submodular Welfare Problem in the value oracle model and is shown to have a potential of wider applicability on the examples of the Generalized Assignment Problem and the AdWords Assignment Problem.

A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions

- Mathematics, Computer ScienceSTOC '00
- 2000

This paper presents a combinatorial polynomial-time algorithm for minimizing submodular functions, answering an open question posed in 1981 by Grotschel, Lov asz, and Schrijver. The algorithm employs…

Submodular Function Minimization under Covering Constraints

- Mathematics, Computer Science2009 50th Annual IEEE Symposium on Foundations of Computer Science
- 2009

This paper presents a rounding 2-approximation algorithm for the sub modular vertex cover problem based on the half-integrality of the continuous relaxation problem, and shows that the rounding algorithm can be performed by one application of submodular function minimization on a ring family.

A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time

- Mathematics, Computer ScienceJ. Comb. Theory, Ser. B
- 2000

We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear programming method.…

Cooperative Cuts: Graph Cuts with Submodular Edge Weights

- Computer Science
- 2010

Not only does this work prove NP hardness even for nonnegative submodular costs, but it also shows a lower bound of Ω(|V |) on the approximation factor for the problem.

Submodular functions and convexity

- MathematicsISMP
- 1982

In “continuous” optimization convex functions play a central role, and linear programming may be viewed as the optimization of very special (linear) objective functions over very special convex domains (polyhedra).