Maximizing Non-Monotone Submodular Functions

Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum facility location problems. Unlike the problem of minimizing submodular functions, the problem of maximizing submodular functions is NP-hard.

[1]  G. Nemhauser,et al.  On the Uncapacitated Location Problem , 1977 .

[2]  Laurence A. Wolsey,et al.  Best Algorithms for Approximating the Maximum of a Submodular Set Function , 1978, Math. Oper. Res..

[3]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[4]  Michel Minoux,et al.  Accelerated greedy algorithms for maximizing submodular set functions , 1978 .

[5]  Satoru Fujishige.  Canonical decompositions of symmetric submodular systems , 1983, Discret. Appl. Math..

[6]  S. Schwartz,et al.  An accelerated sequential algorithm for producing D -optimal designs , 1989 .

[7]  George L. Nemhauser,et al.  The uncapacitated facility location problem , 1990 .

[8]  Mihalis Yannakakis,et al.  Simple Local Search Problems That are Hard to Solve , 1991, SIAM J. Comput..

[9]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[10]  Maurice Queyranne,et al.  A combinatorial algorithm for minimizing symmetric submodular functions , 1995, SODA '95.

[11]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[12]  G. Nemhauser,et al.  Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case☆ , 1996 .

[13]  Paola Alimonti.  Non-oblivious Local Search for MAX 2-CCSP with Application to MAX DICUT , 1997, WG.

[14]  U. Feige.  A threshold of ln n for approximating set cover , 1998, JACM.

[15]  Boris Goldengorin,et al.  The maximization of submodular functions: old and new proofs for the correctness of the dichotomy algorithm , 1999 .

[16]  Maxim Sviridenko,et al.  An 0.828-approximation Algorithm for the Uncapacitated Facility Location Problem , 1999, Discret. Appl. Math..

[17]  G. A. Tijssen,et al.  The Data-Correcting Algorithm for the Minimization of Supermodular Functions , 1999 .

[18]  Alexander Schrijver,et al.  A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory B.

[19]  Satoru Iwata,et al.  A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions , 2000, STOC '00.

[20]  Uri Zwick,et al.  Combinatorial approximation algorithms for the maximum directed cut problem , 2001, SODA '01.

[21]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[22]  Uri Zwick,et al.  Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems , 2002, IPCO.

[23]  Venkatesan Guruswami,et al.  Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses , 2004, Algorithmica.

[24]  Guy Kindler,et al.  Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[25]  Maxim Sviridenko,et al.  A note on maximizing a submodular set function subject to a knapsack constraint , 2004, Oper. Res. Lett..

[26]  Venkatesan Guruswami,et al.  Hardness of Max 3SAT with no mixed clauses , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).

[27]  Ryan O'Donnell,et al.  Noise stability of functions with low influences: Invariance and optimality , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[28]  Jan Vondrák,et al.  Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) , 2007, IPCO.

[29]  Jan Vondrák,et al.  Optimal approximation for the submodular welfare problem in the value oracle model , 2008, STOC.

[30]  Vahab S. Mirrokni,et al.  Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions , 2008, EC '08.

[31]  Lisa Fleischer,et al.  Submodular Approximation: Sampling-based Algorithms and Lower Bounds , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[32]  Vahab S. Mirrokni,et al.  Non-monotone submodular maximization under matroid and knapsack constraints , 2009, STOC '09.

[33]  Jan Vondrák,et al.  Symmetry and Approximability of Submodular Maximization Problems , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[34]  Hadas Shachnai,et al.  Maximizing submodular set functions subject to multiple linear constraints , 2009, SODA.

[35]  Luca Trevisan,et al.  Max cut and the smallest eigenvalue , 2008, STOC '09.

[36]  Vahab S. Mirrokni,et al.  Approximating submodular functions everywhere , 2009, SODA.

[37]  Jan Vondrák,et al.  Submodular Maximization over Multiple Matroids via Generalized Exchange Properties , 2009, Math. Oper. Res..