Randomized adaptive test cover
Paper i proceeding, 2015

In a general combinatorial search problem with binary tests we are given a set of elements and a hypergraph of possible tests, 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. We obtain several general results on the ratio of the expected and worst-case deterministic test number, as well as complexity results for hypergraphs of small rank, and we state some open problems.

randomization

fractional graph theory

game theory

LP duality

combinatorial search

Författare

Peter Damaschke

Chalmers, Data- och informationsteknik, Datavetenskap

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 9079 182-193

Ämneskategorier

Beräkningsmatematik

Diskret matematik

Fundament

Grundläggande vetenskaper

DOI

10.1007/978-3-319-18173-8_13

ISBN

978-3-319-18173-8