An analysis of approximations for maximizing submodular set functions—I

@article{Nemhauser1978AnAO,
  title={An analysis of approximations for maximizing submodular set functions—I},
  author={George L. Nemhauser and Laurence A. Wolsey and Marshall L. Fisher},
  journal={Mathematical Programming},
  year={1978},
  volume={14},
  pages={265-294}
}
LetN be a finite set andz be a real-valued function defined on the set of subsets ofN that satisfies z(S)+z(T)≥z(S⋃T)+z(S⋂T) for allS, T inN. Such a function is called submodular. We consider the problem maxS⊂N{a(S):|S|≤K,z(S) submodular}.Several hard combinatorial optimization problems can be posed in this framework. For example, the problem of finding a maximum weight independent set in a matroid, when the elements of the matroid are colored and the elements of the independent set can have no… 

Best Algorithms for Approximating the Maximum of a Submodular Set Function

This work presents a family of algorithms that involve the partial enumeration of all sets of cardinality q and then a greedy selection of the remaining elements, q = 0,..., K-1.

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

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.

Efficient Submodular Function Maximization under Linear Packing Constraints

An efficient combinatorial algorithm is developed that achieves an approximation ratio of Ω(1 / m1/W), where W= min {bi / Aij : Aij>0} is the width of the packing constraints, and matches the best known performance guarantee for the linear case.

Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)

The generalized assignment problem (GAP) is a special case of the problem, and although the reduction requires |N| to be exponential in the original problem size, it is able to interpret the recent (1 i¾? 1/e)-approximation for GAP by Fleischer et al.[10] in the framework.

Maximizing submodular set functions subject to multiple linear constraints

A framework for maximizing submodular functions subject to d linear constraints is developed that yields a (1 - e)(1- e−1)-approximation to the optimum for any e > 0, where d > 1 is some constant.

Lecture 13 : Gaussian Process Optimization

1.1 Submodularity Consider a finite set of objects Ω and an objective function f that assigns each subset S ⊆ Ω a non-negative value f(S). Finding the subset that maximizes f is intractable in

Maximizing Submodular Functions under Matroid Constraints by Multi-objective Evolutionary Algorithms

The runtime of a multi-objective evolutionary algorithm called GSEMO is investigated until it has obtained a good approximation for submodular functions.

Submodular Order Functions and Assortment Optimization

  • R. Udwani
  • Computer Science, Mathematics
    ArXiv
  • 2021
We define a new class of set functions that in addition to being monotone and subadditive, also admit a very limited form of submodularity defined over a permutation of the ground set. We refer to

Maximizing a class of submodular utility functions

This paper performs a polyhedral analysis of a relevant mixed-integer set and exploits the structure of the utility function h to strengthen the standard submodular formulation significantly, and shows the effectiveness of the new formulation on expected utility maximization in capital budgeting.
...

References

SHOWING 1-10 OF 13 REFERENCES

Comments on the note of Frieze

On the basis of Property P, Frieze defined sets OP1 and OP2 and proved Theorem 3 which may be effective in the search for optimal solutions and changed the notation of [1] by replacing (s} by S and thus the condition s q~ J by S n J = ~, where ~ is the empty set.

Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation

In this paper, a discrete minimization problem arising from storage allocation considerations is studied, and a heuristic is proposed and its performance is analyzed.

Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms

The number of days required to clear a check drawn on a bank in city j depends on the city i in which the check is cashed. Thus, to maximize its available funds, a company that pays bills to numerous

Introduction to the Theory of Matroids

I. Equivalent Axiomatic Definitions and Elementary Properties of Matroids.- 1.1. The first rank-axiomatic definition of a matroid.- 1.2. The independence-axiomatic definition of a matroid.- 1.3. The

Cores of convex games

The core of ann-person game is the set of feasible outcomes that cannot be improved upon by any coalition of players. A convex game is defined as one that is based on a convex set function. In this

A cost function property for plant location problems

From Property P, all the results on 'gain' functions used to solve simple plant location problems as well as the existence of a class of sub-optimal subsets are developed.

Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms"

In the course of the deliberations of the 1977 Lanchester Prize Committee, Alan J. Goldman brought to the authors' attention an error in the proof of Lemma 1 of their paper, which is true and the original correct, but long and intricate, proof was provided.

P-Complete Approximation Problems

For P-complete problems such as traveling salesperson, cycle covers, 0-1 integer programming, multicommodity network flows, quadratic assignment, etc., it is shown that the approximation problem is

Matroids and the greedy algorithm

Linear-algebra rank is the solution to an especially tractable optimization problem which are linear programs relative to certain derived polyhedra.