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

Authors

182

  1. MS
    Maxim Sviridenko

    IBM Research - Thomas J. Watson Research Center, United States

    5 publications · 598 citations

    5

    h-index

  2. VN
    Viswanath Nagarajan

    Carnegie Mellon University, United States

    5 publications · 510 citations

    5

    h-index

  3. VM
    Vahab Mirrokni

    Google (United States), United States

    4 publications · 633 citations

    4

    h-index

  4. JL
    Jon Lee

    IBM (United States), United States

    4 publications · 568 citations

    4

    h-index

  5. GC
    Guihai Chen

    Shanghai Jiao Tong University, China

    3 publications · 89 citations

    3

    h-index

1–5 of 182

Venues

  1. Mathematical Programming

    4 publications · 118 citations

    4

    h-index

  2. arXiv (Cornell University)

    Repository · 4 publications · 102 citations

    4

    h-index

  3. Mathematics of Operations Research

    3 publications · 115 citations

    3

    h-index

  4. SIAM Journal on Discrete Mathematics

    3 publications · 254 citations

    3

    h-index

  5. Theoretical Computer Science

    2 publications · 177 citations

    2

    h-index

1–5