Skip to Main content Skip to Navigation
Journal articles

Coupon collecting and transversals of hypergraphs

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-00980772
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Friday, April 18, 2014 - 4:44:00 PM
Last modification on : Thursday, September 7, 2017 - 1:03:48 AM
Long-term archiving on: : Monday, April 10, 2017 - 3:35:24 PM

File

2331-8318-2-PB.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00980772, version 1

Collections

Citation

Marcel Wild, Svante Janson, Stephan Wagner, Dirk Laurie. Coupon collecting and transversals of hypergraphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2013, Vol. 15 no. 2 (2), pp.259--270. ⟨hal-00980772⟩

Share

Metrics

Record views

819

Files downloads

954