Matroid Partition Property and the Secretary Problem

(24:59)

Matroid Secretary is Equivalent to Contention Resolution

(39:5)

A Simple O(loglog(rank))-Competitive Algorithm for the Matroid Secretary Problem

(49:37)

Matroid Secretary Problem by Sourav Chakraborty

(34:32)

Prophet secretary for $k$-knapsack and $l$-matroid intersection via continuous exchange property

(23:49)

An Efficient Reduction of a Gammoid to a Partition Matroid

(18:36)

Secretary Problems and Online Selection with A Priori Information

(48:6)

A $log(k)$ algorithm for the matroid secretary problem

(2:6)

The Geometry of Matroids

(1:5:51)

Machine-Checked Proofs and the Rise of Formal Methods in Mathematics | Theoretically Speaking

(1:25:21)

Introduction to Matroids

(1:7:3)

12. Greedy Algorithms: Minimum Spanning Tree

(1:22:10)

Mathematical Way to Choose a Toilet - Numberphile

(7:49)

Spaces of Lorentzian Polynomials - Mario Kummer

(1:3:9)

Lecture 1 . Matroids (Federico Ardila)

(23:54)

R6. Greedy Algorithms

(22:24)

Polytopes and Matroids

(1:49:33)

DAA-Lecture-08: Matroids

(52:24)

Matroids Lecture 1: Matroid via Independence

(9:38)

9.5 Matroids, Part V

(27:25)

Matroids

(7:28)

5-3 Matroids

(11:12)

Rico Zenklusen: The Submodular Secretary Problem Goes Linear

(30:13)

9.3 Matroids, Part III

(20:7)

9.7 Matroids, Part VII

(33:14)

Geoff Whittle - From Matroids to Mining

(9:54)

Lean Together 2021: Formalising matroids

(46:51)

Faster Matroid Intersection

(22:35)