Submodular Optimization is a branch of discrete optimization that focuses on the maximization or minimization of submodular functions, which exhibit a diminishing returns property, over feasible subsets within a combinatorial structure.
988
Publications
71.6K
Citations
1.5K
Authors
536
Institutions
Publications per year
2017–2026
421
Publications
988
Maximizing the spread of influence through a social network
David Kempe, Jon Kleinberg, Éva Tardos · 2003 · 7.3K citations
Minimizing a Submodular Function on a Lattice
Donald M. Topkis · Operations Research · 1978 · 1.4K citations
Maximizing the spread of influence through a social network
David Kempe, Jon Kleinberg, Éva Tardos · 2003 · 1.1K citations
1–5 of 988
Authors
1.5K
- AK
34
h-index
- JB
27
h-index
- HD
22
h-index
- MF
21
h-index
- AK
21
h-index
1–5 of 1.5K
Institutions
536
University of Washington
Seattle, United States
31 h-index
124 publications
24.7K citations
Google (United States)
Mountain View, United States
27 h-index
73 publications
3K citations
ETH Zurich
Zurich, Switzerland
26 h-index
100 publications
7.9K citations
Carnegie Mellon University
Pittsburgh, United States
26 h-index
77 publications
6.6K citations
Nanjing University
Nanjing, China
24 h-index
97 publications
4.2K citations
Microsoft (United States)
Redmond, United States
21 h-index
31 publications
1.9K citations
Stanford University
Stanford, United States
20 h-index
41 publications
2.2K citations
University of California, Berkeley
Berkeley, United States
19 h-index
40 publications
1.5K citations
1–8 of 536
Venues
- arXiv (Cornell University)
Repository · 128 publications · 4.9K citations
35
h-index
- Proceedings of the AAAI Conference on Artificial Intelligence
Conference · 27 publications · 1.2K citations
18
h-index
- Mathematical Programming
24 publications · 1.7K citations
18
h-index
- Neural Information Processing Systems
Conference · 15 publications · 515 citations
14
h-index
- SIAM Journal on Computing
15 publications · 2.4K citations
14
h-index
1–5