The Weighted Coupon Collector’s Problem and Applications

DOI10.1007/978-3-642-02882-3_45zbMath1248.68232OpenAlexW1831641206MaRDI QIDQ5323093

Petra Berenbrink, Thomas Sauerwald

Publication date: 23 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02882-3_45

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Random walks on graphs (05C81)

Related Items (3)

The number of K-tons in the coupon collector problem ⋮ Computing absorbing times via fluid approximations ⋮ Two poisson limit theorems for the coupon collector’s problem with group drawings

Cites Work

• Unnamed Item
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• Randomized broadcast in networks
• A tight upper bound on the cover time for random walks on graphs
• The coupon-collector's problem revisited
• Extremal cover times for random walks on trees
• Elementary Probability
• A tight lower bound on the cover time for random walks on graphs
• On the Runtime and Robustness of Randomized Broadcasting

This page was built for publication: The Weighted Coupon Collector’s Problem and Applications