We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
Recently, the conjecture that the expected number of tests is nondecreasing in the failure probability for binomial group testing has been proved. The proof has also been extended to three models of multiaccess systems. However, probabilistic algorithms are used as a crucial part of these proofs. In this paper, we give conceptually simpler new proofs without using probabilistic algorithms. We also extend the result to a more general model where the number of tests is replaced by a cost function.
Email your librarian or administrator to recommend adding this journal to your organisation's collection.
