The Labeled Coupon Collector Problem with Random Sample Sizes and Partial Recovery
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929698804596736 |
|---|---|
| author | Berrebi, Shoham Shimon Yaakobi, Eitan Yakhini, Zohar Bar-Lev, Daniella |
| author_facet | Berrebi, Shoham Shimon Yaakobi, Eitan Yakhini, Zohar Bar-Lev, Daniella |
| contents | We extend the Coupon Collector's Problem (CCP) and present a novel generalized model, referred as the k-LCCP problem, where one is interested in recovering a bipartite graph with a perfect matching, which represents the coupons and their matching labels. We show two extra-extensions to this variation: the heterogeneous sample size case (K-LCCP) and the partly recovering case. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_02968 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The Labeled Coupon Collector Problem with Random Sample Sizes and Partial Recovery Berrebi, Shoham Shimon Yaakobi, Eitan Yakhini, Zohar Bar-Lev, Daniella Discrete Mathematics We extend the Coupon Collector's Problem (CCP) and present a novel generalized model, referred as the k-LCCP problem, where one is interested in recovering a bipartite graph with a perfect matching, which represents the coupons and their matching labels. We show two extra-extensions to this variation: the heterogeneous sample size case (K-LCCP) and the partly recovering case. |
| title | The Labeled Coupon Collector Problem with Random Sample Sizes and Partial Recovery |
| topic | Discrete Mathematics |
| url | https://arxiv.org/abs/2502.02968 |