Combinatorial search in two and more rounds
Artikel i vetenskaplig tidskrift, 2019

In a combinatorial search problem we wish to identify an unknown element by binary tests, where the edges of a hypergraph specify the available tests. We show that, for rather general cases of this problem, the worst-case minimum number of tests, even if adaptive testing is permitted, can already be achieved in a small number of rounds of parallel tests. In particular, the maximum number of necessary rounds grows only as the square root of the number of elements, and two rounds are enough if, e.g., the test number is close to the number of elements, or the hypergraph is a graph. We also provide polynomial-time, hardness, and parameterized results on the computational
complexity of finding optimal strategies for some cases, including graphs and tree hypergraphs.

adaptive strategy

combinatorial search

test cover

matching

Författare

Peter Damaschke

Chalmers, Data- och informationsteknik, Data Science

Theoretical Computer Science

0304-3975 (ISSN)

Vol. 780 1-11

Fundament

Grundläggande vetenskaper

Ämneskategorier

Datavetenskap (datalogi)

Diskret matematik

DOI

10.1016/j.tcs.2019.02.004

Mer information

Skapat

2019-07-08