Coupon collecting and transversals of hypergraphs

Marcel Wild, Svante Janson, Stephan G. Wagner, Dirk Laurie · Discrete Mathematics & Theoretical Computer Science · 2013

Analysis of Algorithms The classic Coupon-Collector Problem (CCP) is generalized. Only basic probability theory is used. Centerpiece rather is an algorithm that efficiently counts all k-element transversals of a set system.

Read the paper · More papers on PaperTik