On separating systems with bounded set size

DOI10.1016/j.dam.2019.10.033zbMath1433.68269OpenAlexW2986917802WikidataQ126809715 ScholiaQ126809715MaRDI QIDQ2309567

Gábor Wiener, János Tapolcai, Éva Hosszu

Publication date: 1 April 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.10.033

zbMATH Keywords

group testing\(k\)-setseparating systemnon-adaptive search

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Combinatorics in computer science (68R05) Extremal set theory (05D05)

Cites Work

• Unnamed Item
• Unnamed Item
• On separating systems whose elements are sets of at most k elements
• Ratewise-optimal non-sequential search strategies under constraints on the tests
• On separating systems of a finite set
• Minimal completely separating systems

This page was built for publication: On separating systems with bounded set size