Deterministic versus randomized adaptive test cover
Artikel i vetenskaplig tidskrift, 2016

In a combinatorial search problem with binary tests, we are given a set of elements (vertices) and a hypergraph of possible tests (hyperedges), and the goal is to find an unknown target element using a minimum number of tests. We explore the expected test number of randomized strategies. Our main results are that the ratio of the randomized and deterministic test numbers can be logarithmic in the number of elements, that the optimal deterministic test number can be approximated (in polynomial time) only within a logarithmic factor, whereas an approximation ratio 2 can be achieved in the randomized case, and that optimal randomized strategies can be efficiently constructed at least for special classes of graphs.

randomization

set cover

combinatorial search

game theory

LP duality

fractional graph theory

Författare

Peter Damaschke

Chalmers, Data- och informationsteknik, Datavetenskap

Theoretical Computer Science

0304-3975 (ISSN)

Vol. 653 42-52

Ämneskategorier

Beräkningsmatematik

Diskret matematik

Fundament

Grundläggande vetenskaper

DOI

10.1016/j.tcs.2016.09.019