Matroid Optimization
Matroid Optimization is a discrete optimization framework that generalizes the selection of independent sets in a matroid structure, distinguished by its ability to model combinatorial problems where greedy algorithms yield optimal solutions due to the hereditary and exchange properties inherent in matroidal independence systems.
84
Publications
4.8K
Citations
182
Authors
113
Institutions
Publications per year
2017–2026
31
84
Greedy sensor selection: Leveraging submodularity
Manohar Shamaiah, Siddhartha Banerjee, Haris Vikalo · 2010 · 305 citations
Non-monotone submodular maximization under matroid and knapsack constraints
Jon Lee, Vahab Mirrokni, Viswanath Nagarajan et al. · 2009 · 225 citations
1–5 of 84
182
IBM Research - Thomas J. Watson Research Center, United States
5 publications · 598 citations
5
h-index
5
h-index
4
h-index
4
h-index
3
h-index
1–5 of 182
113

Sapienza University of Rome
Rome, Italy
5 h-index
8 publications
264 citations
Carnegie Mellon University
Pittsburgh, United States
4 h-index
6 publications
377 citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
3 h-index
5 publications
143 citations
Lamsade
Paris, France
3 h-index
7 publications
140 citations
Virginia Tech
Blacksburg, United States
3 h-index
5 publications
123 citations
Stanford University
Stanford, United States
3 h-index
6 publications
154 citations
University of Washington
Seattle, United States
3 h-index
8 publications
263 citations
Nanjing University
Nanjing, China
3 h-index
15 publications
333 citations
1–8 of 113
4 publications · 118 citations
4
h-index
Repository · 4 publications · 102 citations
4
h-index
3 publications · 115 citations
3
h-index
3 publications · 254 citations
3
h-index
2 publications · 177 citations
2
h-index
1–5