Maximizing submodular set functions subject to multiple linear constraints

@inproceedings{Kulik2009MaximizingSS,
  title={Maximizing submodular set functions subject to multiple linear constraints},
  author={A. Kulik and H. Shachnai and Tami Tamir},
  booktitle={SODA},
  year={2009}
}
The concept of submodularity plays a vital role in combinatorial optimization. In particular, many important optimization problems can be cast as submodular maximization problems, including maximum coverage, maximum facility location and max cut in directed/undirected graphs. In this paper we present the first known approximation algorithms for the problem of maximizing a nondecreasing submodular set function subject to multiple linear constraints. Given a d-dimensional budget vector… Expand
167 Citations
Efficient Submodular Function Maximization under Linear Packing Constraints
  • 30
  • PDF
Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints
  • 68
  • PDF
Non-monotone submodular maximization under matroid and knapsack constraints
  • 203
  • PDF
Submodular maximization by simulated annealing
  • 130
  • PDF
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
  • 203
  • PDF
Submodular Functions Maximization Problems
  • 18
  • PDF
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
  • 152
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 26 REFERENCES
Non-monotone submodular maximization under matroid and knapsack constraints
  • 203
  • PDF
Optimal approximation for the submodular welfare problem in the value oracle model
  • 482
  • PDF
An analysis of approximations for maximizing submodular set functions—I
  • 3,665
  • PDF
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
  • 371
  • PDF
The Budgeted Maximum Coverage Problem
  • 801
  • PDF
Maximizing Non-Monotone Submodular Functions
  • 249
  • PDF
Maximizing Non-Monotone Submodular Functions
  • 172
  • Highly Influential
  • PDF
Tight approximation algorithms for maximum general assignment problems
  • 138
  • Highly Influential
Auctions with Budget Constraints
  • 78
  • PDF
...
1
2
3
...