Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints

Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hypergraphs, certain constraint satisfaction problems, maximum entropy sampling, and maximum facility location problems. Un...

Full description

Saved in:

Bibliographic Details
Published in:	SIAM journal on discrete mathematics Vol. 23; no. 4; pp. 2053 - 2078
Main Authors:	Lee, Jon, Mirrokni, Vahab S., Nagarajan, Viswanath, Sviridenko, Maxim
Format:	Journal Article
Language:	English
Published:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2010
Subjects:	Algebra Algorithmics. Computability. Computer arithmetics Algorithms Applied mathematics Applied sciences Approximation Combinatorics Combinatorics. Ordered structures Computer science; control theory; systems Convex and discrete geometry Design of experiments Entropy Exact sciences and technology Geometry Graph theory Graphs Mathematical programming Mathematics Optimization Random variables Sciences and techniques of general use Theoretical computing Hypergraph Constraint Combinatorial problem Matroid Optimization method Entropy 68W25 approximation algorithms Approximation algorithm Combinatorial optimization Location problem Maximum matroid and knapsack constraints Discrete mathematics Sampling Monotonic function Partition Approximation Maximization Minimization 90C27 Knapsack problem submodular maximization Graph cut Digraph Directed graph
ISSN:	0895-4801, 1095-7146
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!