home.social

#matroid — Public Fediverse posts

Live and recent posts from across the Fediverse tagged #matroid, aggregated by home.social.

  1. 'Deletion Robust Non-Monotone Submodular Maximization over Matroids', by Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam.

    jmlr.org/papers/v26/23-1219.ht

    #matroid #matroids #algorithms

  2. 'Deletion Robust Non-Monotone Submodular Maximization over Matroids', by Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam.

    jmlr.org/papers/v26/23-1219.ht

    #matroid #matroids #algorithms

  3. 'Deletion Robust Non-Monotone Submodular Maximization over Matroids', by Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam.

    jmlr.org/papers/v26/23-1219.ht

    #matroid #matroids #algorithms

  4. 'Deletion Robust Non-Monotone Submodular Maximization over Matroids', by Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam.

    jmlr.org/papers/v26/23-1219.ht

    #matroid #matroids #algorithms

  5. 'Deletion Robust Non-Monotone Submodular Maximization over Matroids', by Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam.

    jmlr.org/papers/v26/23-1219.ht

    #matroid #matroids #algorithms

  6. Great introductory article on #matroid s:

    Neel, David L., and Nancy Ann Neudauer. 2009. “Matroids You Have Known.” Mathematics Magazine 82 (1): 26–41. doi.org/10.1080/0025570X.2009..

  7. Great introductory article on #matroid s:

    Neel, David L., and Nancy Ann Neudauer. 2009. “Matroids You Have Known.” Mathematics Magazine 82 (1): 26–41. doi.org/10.1080/0025570X.2009..

  8. Great introductory article on #matroid s:

    Neel, David L., and Nancy Ann Neudauer. 2009. “Matroids You Have Known.” Mathematics Magazine 82 (1): 26–41. doi.org/10.1080/0025570X.2009..

  9. #Matroid s are a specific kind of sets that contain other sets, but for any set they contain, they also need to contain its subsets. For more look here:

    en.wikipedia.org/wiki/Matroid

    Looking oddly specific, they're in fact an interesting structure which pops out in the study of many combinatorial subjects like graph theory, and, as I just learned, #homology!

  10. #Matroid s are a specific kind of sets that contain other sets, but for any set they contain, they also need to contain its subsets. For more look here:

    en.wikipedia.org/wiki/Matroid

    Looking oddly specific, they're in fact an interesting structure which pops out in the study of many combinatorial subjects like graph theory, and, as I just learned, #homology!

  11. #Matroid s are a specific kind of sets that contain other sets, but for any set they contain, they also need to contain its subsets. For more look here:

    en.wikipedia.org/wiki/Matroid

    Looking oddly specific, they're in fact an interesting structure which pops out in the study of many combinatorial subjects like graph theory, and, as I just learned, #homology!