Submodularity In Matroids

Submodularity in Matroids is a mathematical property characterizing set functions on matroid structures that exhibit diminishing returns, distinguished by its specific adherence to the submodular inequality inherently satisfied by the rank function of a matroid.

74

Publications

6.4K

Citations

108

Authors

63

Institutions

Publications per year

2017–2026

14

Authors

108

  1. MS
    Maxim Sviridenko

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

    6 publications · 774 citations

    6

    h-index

  2. MF
    Moran Feldman

    Technion – Israel Institute of Technology, Israel

    6 publications · 124 citations

    6

    h-index

  3. JV
    J. Vondrák

    IBM Research - Almaden, United States

    5 publications · 1.4K citations

    5

    h-index

  4. JW
    Justin Ward

    University of Warwick, United Kingdom

    5 publications · 169 citations

    5

    h-index

  5. JL
    Jon Lee

    IBM (United States), United States

    4 publications · 712 citations

    4

    h-index

1–5 of 108

Venues

  1. arXiv (Cornell University)

    Repository · 7 publications · 155 citations

    7

    h-index

  2. SIAM Journal on Computing

    4 publications · 971 citations

    4

    h-index

  3. ACM Transactions on Algorithms

    TALG · 4 publications · 280 citations

    4

    h-index

  4. Discrete Mathematics

    4 publications · 172 citations

    4

    h-index

  5. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 4 publications · 77 citations

    4

    h-index

1–5