Randomized adaptive test cover
Paper in proceedings, 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

Author

Peter Damaschke

Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 9079 182-193

Subject Categories

Computational Mathematics

Discrete Mathematics

Roots

Basic sciences

DOI

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

ISBN

978-3-319-18173-8

More information

Created

10/8/2017