Maximizing non-monotone submodular set functions subject to different constraints: Combined algorithms

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Michel X. Goemans, David P. Williamson · Journal of the ACM · 1995 · 3.7K citations · Full text

Computing, Computer Science, Algorithms +14

A threshold of ln <i>n</i> for approximating set cover

Uriel Feige · Journal of the ACM · 1998 · 3.1K citations · Full text

Natural Sciences, Computer Science, Mathematics +16

A combinatorial strongly polynomial algorithm for minimizing submodular functions

Satoru Iwata, Lisa Fleischer, Satoru Fujishige · Journal of the ACM · 2001 · 585 citations

Computing, Computer Science, Mathematics +14

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

Jan Vondrák · 2008 · 572 citations

Natural Sciences, Decision Sciences, Algorithms +13

Optimal marketing strategies over social networks

Jason D. Hartline, Vahab Mirrokni, M. Sundararajan · 2008 · 387 citations

Business, Marketing, Marketing Management +11