2000 character limit reached
Coupons collecting with or without replacement, and with multipurpose coupons (1107.1401v3)
Published 7 Jul 2011 in math.PR and cs.DM
Abstract: The classic Coupon-Collector Problem (CCP) is generalized to the extent that each coupons serves certain "purposes". Only basic probability theory is used. Centerpiece rather is an algorithm that efficiently counts all $k$-element transversals of a set system.