arXiv Open Access 2025

The Labeled Coupon Collector Problem with Random Sample Sizes and Partial Recovery

Shoham Shimon Berrebi Eitan Yaakobi Zohar Yakhini Daniella Bar-Lev

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.DM

Penulis (4)

Shoham Shimon Berrebi

Eitan Yaakobi

Zohar Yakhini

Daniella Bar-Lev

Format Sitasi

APA MLA BibTeX

Berrebi, S.S., Yaakobi, E., Yakhini, Z., Bar-Lev, D. (2025). The Labeled Coupon Collector Problem with Random Sample Sizes and Partial Recovery. https://arxiv.org/abs/2502.02968

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2025
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓