8 citations · 8 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Asymmetric Palette Sparsification, Slightly Simplified
Andrew McGregor
We present a slightly simplified analysis of the asymmetric palette sparsification result by Assadi and Yazdanyar [TheoretiCS, 2026]. The motivation is mainly pedagogical; our appr…
cs.DS2026
Matchings via Random Greedy Independent Set: A Simpler Algorithm and Analysis
Andrew McGregor
We show that a simple extension of the randomized greedy maximal independent set algorithm yields a constant approximation for the maximum matching problem. The algorithm is a simp…