2 papers
cs.DS2025
The -Fold Matroid Secretary Problem
Rishi Gujjar, Kevin Hua, Robert Kleinberg +1
In the matroid secretary problem, elements of a matroid arrive in random order. When an element arrives, its weight is revealed and a choice…
cs.DS2024
Finding Most Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear Time
Kevin Hua, Daniel Li, Jaewoo Park +1
We show the first near-linear time randomized algorithms for listing all minimum vertex cuts of polylogarithmic size that separate the graph into at least three connected component…