Matroid Intersection is a fundamental construct in combinatorial optimization that identifies the largest common independent set between two matroids defined on the same ground set, distinguished by its characterization through min-max theorems and algorithmic tractability in finding maximum intersections.
91
Publications
3.7K
Citations
141
Authors
90
Institutions
Publications per year
2017–2026
9
Parents
Publications
91
Robert Kleinberg, S. Matthew Weinberg · 2012 · 228 citations
Minimum Bounded Degree Spanning Trees
Michel X. Goemans · 2006 · 175 citations
A weighted matroid intersection algorithm
András Frank · Journal of Algorithms · 1981 · 170 citations
1–5 of 91
Authors
141
- KM
6
h-index
- VN
4
h-index
- RZ
4
h-index
- HN
4
h-index
- JO
4
h-index
1–5 of 141
Institutions
90
Massachusetts Institute of Technology
Cambridge, United States
9 h-index
11 publications
976 citations
IBM (United States)
Armonk, United States
6 h-index
7 publications
358 citations
Carnegie Mellon University
Pittsburgh, United States
5 h-index
9 publications
245 citations
University of Colorado Boulder
Boulder, United States
5 h-index
8 publications
285 citations
Eötvös Loránd University
Budapest, Hungary
5 h-index
5 publications
104 citations
Louisiana State University
Baton Rouge, United States
4 h-index
4 publications
124 citations
Technion – Israel Institute of Technology
Haifa, Israel
4 h-index
7 publications
268 citations
IIT@MIT
Cambridge, United States
4 h-index
4 publications
510 citations
1–8 of 90
Venues
- SIAM Journal on Computing
8 publications · 391 citations
8
h-index
- SIAM Journal on Discrete Mathematics
8 publications · 244 citations
8
h-index
- Mathematical Programming
6 publications · 220 citations
6
h-index
- Journal of Combinatorial Theory Series B
6 publications · 207 citations
6
h-index
- Mathematics of Operations Research
3 publications · 106 citations
3
h-index
1–5